./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b059dfef9f85366fcaeddec812cf96c32b1df0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b059dfef9f85366fcaeddec812cf96c32b1df0d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:23:19,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:23:19,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:23:19,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:23:19,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:23:19,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:23:19,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:23:19,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:23:19,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:23:19,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:23:19,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:23:19,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:23:19,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:23:19,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:23:19,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:23:19,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:23:19,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:23:19,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:23:19,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:23:19,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:23:19,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:23:19,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:23:19,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:23:19,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:23:19,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:23:19,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:23:19,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:23:19,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:23:19,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:23:19,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:23:19,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:23:19,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:23:19,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:23:19,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:23:19,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:23:19,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:23:19,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:23:19,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:23:19,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:23:19,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:23:19,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:23:19,601 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:23:19,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:23:19,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:23:19,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:23:19,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:23:19,614 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:23:19,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:23:19,615 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:23:19,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:23:19,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:23:19,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:23:19,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:23:19,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:23:19,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:23:19,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:23:19,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:23:19,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:23:19,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:23:19,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:23:19,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:23:19,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:23:19,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:23:19,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:19,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:23:19,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:23:19,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:23:19,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:23:19,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:23:19,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:23:19,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:23:19,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer 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(__VERIFIER_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 -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-12-07 14:23:19,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:23:19,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:23:19,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:23:19,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:23:19,753 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:23:19,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-12-07 14:23:19,793 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/e7e56d2a7/c3caa752dd2b4dc8afd664c30d3fe263/FLAG741eb8f5d [2019-12-07 14:23:20,251 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:23:20,251 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-12-07 14:23:20,264 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/e7e56d2a7/c3caa752dd2b4dc8afd664c30d3fe263/FLAG741eb8f5d [2019-12-07 14:23:20,272 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/e7e56d2a7/c3caa752dd2b4dc8afd664c30d3fe263 [2019-12-07 14:23:20,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:23:20,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:23:20,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:20,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:23:20,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:23:20,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3266040e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20, skipping insertion in model container [2019-12-07 14:23:20,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:23:20,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:23:20,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:20,598 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:23:20,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:20,679 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:23:20,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20 WrapperNode [2019-12-07 14:23:20,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:20,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:20,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:23:20,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:23:20,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:20,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:23:20,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:23:20,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:23:20,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... [2019-12-07 14:23:20,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:23:20,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:23:20,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:23:20,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:23:20,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:23:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:23:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:23:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:23:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:23:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:23:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:23:20,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:23:20,989 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:23:21,447 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 14:23:21,447 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 14:23:21,448 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:23:21,448 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:23:21,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:21 BoogieIcfgContainer [2019-12-07 14:23:21,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:23:21,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:23:21,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:23:21,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:23:21,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:23:20" (1/3) ... [2019-12-07 14:23:21,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51507fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:21, skipping insertion in model container [2019-12-07 14:23:21,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:20" (2/3) ... [2019-12-07 14:23:21,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51507fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:21, skipping insertion in model container [2019-12-07 14:23:21,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:21" (3/3) ... [2019-12-07 14:23:21,454 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-12-07 14:23:21,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:23:21,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:23:21,473 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:23:21,489 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:23:21,489 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:23:21,489 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:23:21,489 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:23:21,489 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:23:21,489 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:23:21,489 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:23:21,489 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:23:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-12-07 14:23:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:23:21,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:21,508 INFO L410 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] [2019-12-07 14:23:21,509 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-12-07 14:23:21,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:21,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839073433] [2019-12-07 14:23:21,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:21,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839073433] [2019-12-07 14:23:21,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:21,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:21,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802007898] [2019-12-07 14:23:21,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:21,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:21,723 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-12-07 14:23:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:21,958 INFO L93 Difference]: Finished difference Result 259 states and 432 transitions. [2019-12-07 14:23:21,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:21,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 14:23:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:21,972 INFO L225 Difference]: With dead ends: 259 [2019-12-07 14:23:21,972 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 14:23:21,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 14:23:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-12-07 14:23:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 14:23:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2019-12-07 14:23:22,013 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2019-12-07 14:23:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:22,014 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2019-12-07 14:23:22,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2019-12-07 14:23:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:23:22,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:22,016 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:22,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:22,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:22,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1411658380, now seen corresponding path program 1 times [2019-12-07 14:23:22,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:22,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927035303] [2019-12-07 14:23:22,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:23:22,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927035303] [2019-12-07 14:23:22,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:22,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:22,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132783458] [2019-12-07 14:23:22,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:22,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:22,128 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 3 states. [2019-12-07 14:23:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:22,161 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2019-12-07 14:23:22,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:22,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 14:23:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:22,164 INFO L225 Difference]: With dead ends: 327 [2019-12-07 14:23:22,165 INFO L226 Difference]: Without dead ends: 220 [2019-12-07 14:23:22,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-07 14:23:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-12-07 14:23:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-07 14:23:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2019-12-07 14:23:22,183 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2019-12-07 14:23:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:22,184 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2019-12-07 14:23:22,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2019-12-07 14:23:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:23:22,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:22,187 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:22,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1352249408, now seen corresponding path program 1 times [2019-12-07 14:23:22,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:22,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612458247] [2019-12-07 14:23:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:23:22,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612458247] [2019-12-07 14:23:22,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:22,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:22,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310185045] [2019-12-07 14:23:22,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:22,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:22,248 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 3 states. [2019-12-07 14:23:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:22,308 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2019-12-07 14:23:22,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:22,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 14:23:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:22,310 INFO L225 Difference]: With dead ends: 429 [2019-12-07 14:23:22,310 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 14:23:22,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 14:23:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-12-07 14:23:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-07 14:23:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2019-12-07 14:23:22,327 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2019-12-07 14:23:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:22,327 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2019-12-07 14:23:22,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2019-12-07 14:23:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:23:22,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:22,330 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2019-12-07 14:23:22,330 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 210697016, now seen corresponding path program 1 times [2019-12-07 14:23:22,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:22,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498881311] [2019-12-07 14:23:22,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:22,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498881311] [2019-12-07 14:23:22,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:22,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:22,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935299532] [2019-12-07 14:23:22,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:22,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:22,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:22,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:22,405 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand 4 states. [2019-12-07 14:23:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:22,777 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2019-12-07 14:23:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:22,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 14:23:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:22,780 INFO L225 Difference]: With dead ends: 822 [2019-12-07 14:23:22,780 INFO L226 Difference]: Without dead ends: 510 [2019-12-07 14:23:22,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-12-07 14:23:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2019-12-07 14:23:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-07 14:23:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2019-12-07 14:23:22,793 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2019-12-07 14:23:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:22,793 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2019-12-07 14:23:22,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2019-12-07 14:23:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:23:22,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:22,795 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2019-12-07 14:23:22,795 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash 76683510, now seen corresponding path program 1 times [2019-12-07 14:23:22,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:22,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467179114] [2019-12-07 14:23:22,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:22,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467179114] [2019-12-07 14:23:22,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:22,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:22,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035160915] [2019-12-07 14:23:22,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:22,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:22,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:22,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:22,853 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 4 states. [2019-12-07 14:23:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:23,110 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2019-12-07 14:23:23,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:23,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 14:23:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:23,114 INFO L225 Difference]: With dead ends: 818 [2019-12-07 14:23:23,114 INFO L226 Difference]: Without dead ends: 456 [2019-12-07 14:23:23,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-07 14:23:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2019-12-07 14:23:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-07 14:23:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2019-12-07 14:23:23,127 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2019-12-07 14:23:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:23,128 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2019-12-07 14:23:23,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2019-12-07 14:23:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:23:23,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:23,129 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1] [2019-12-07 14:23:23,130 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2062745025, now seen corresponding path program 1 times [2019-12-07 14:23:23,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:23,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563825084] [2019-12-07 14:23:23,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:23,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563825084] [2019-12-07 14:23:23,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:23,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:23,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752264662] [2019-12-07 14:23:23,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:23,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:23,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:23,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:23,193 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2019-12-07 14:23:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:23,546 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2019-12-07 14:23:23,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:23,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 14:23:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:23,549 INFO L225 Difference]: With dead ends: 946 [2019-12-07 14:23:23,549 INFO L226 Difference]: Without dead ends: 544 [2019-12-07 14:23:23,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-07 14:23:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 414. [2019-12-07 14:23:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 14:23:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2019-12-07 14:23:23,559 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2019-12-07 14:23:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:23,559 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2019-12-07 14:23:23,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2019-12-07 14:23:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:23:23,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:23,561 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1] [2019-12-07 14:23:23,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2019-12-07 14:23:23,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:23,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104904431] [2019-12-07 14:23:23,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:23,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104904431] [2019-12-07 14:23:23,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:23,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:23,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966156872] [2019-12-07 14:23:23,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:23,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:23,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:23,625 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand 4 states. [2019-12-07 14:23:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:23,990 INFO L93 Difference]: Finished difference Result 948 states and 1426 transitions. [2019-12-07 14:23:23,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:23,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 14:23:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:23,993 INFO L225 Difference]: With dead ends: 948 [2019-12-07 14:23:23,993 INFO L226 Difference]: Without dead ends: 544 [2019-12-07 14:23:23,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-07 14:23:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 416. [2019-12-07 14:23:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 14:23:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2019-12-07 14:23:24,002 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 74 [2019-12-07 14:23:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:24,002 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2019-12-07 14:23:24,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2019-12-07 14:23:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:23:24,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:24,003 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1] [2019-12-07 14:23:24,003 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2019-12-07 14:23:24,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:24,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338856977] [2019-12-07 14:23:24,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:24,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338856977] [2019-12-07 14:23:24,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:24,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:24,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952798279] [2019-12-07 14:23:24,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:24,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:24,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:24,072 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2019-12-07 14:23:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:24,427 INFO L93 Difference]: Finished difference Result 940 states and 1414 transitions. [2019-12-07 14:23:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:24,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 14:23:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:24,430 INFO L225 Difference]: With dead ends: 940 [2019-12-07 14:23:24,430 INFO L226 Difference]: Without dead ends: 534 [2019-12-07 14:23:24,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-07 14:23:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 418. [2019-12-07 14:23:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2019-12-07 14:23:24,439 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 75 [2019-12-07 14:23:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:24,439 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2019-12-07 14:23:24,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2019-12-07 14:23:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:24,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:24,441 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:24,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1935805867, now seen corresponding path program 2 times [2019-12-07 14:23:24,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:24,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850224841] [2019-12-07 14:23:24,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:24,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850224841] [2019-12-07 14:23:24,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:24,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:24,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143350151] [2019-12-07 14:23:24,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:24,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:24,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:24,489 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2019-12-07 14:23:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:24,847 INFO L93 Difference]: Finished difference Result 940 states and 1412 transitions. [2019-12-07 14:23:24,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:24,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:23:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:24,850 INFO L225 Difference]: With dead ends: 940 [2019-12-07 14:23:24,850 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 14:23:24,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 14:23:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-12-07 14:23:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2019-12-07 14:23:24,863 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 87 [2019-12-07 14:23:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:24,864 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2019-12-07 14:23:24,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2019-12-07 14:23:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:24,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:24,865 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 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] [2019-12-07 14:23:24,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1954461325, now seen corresponding path program 1 times [2019-12-07 14:23:24,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:24,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797727627] [2019-12-07 14:23:24,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:24,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797727627] [2019-12-07 14:23:24,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:24,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:24,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419621309] [2019-12-07 14:23:24,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:24,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:24,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:24,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:24,915 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand 4 states. [2019-12-07 14:23:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:25,281 INFO L93 Difference]: Finished difference Result 940 states and 1408 transitions. [2019-12-07 14:23:25,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:25,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:23:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:25,284 INFO L225 Difference]: With dead ends: 940 [2019-12-07 14:23:25,284 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 14:23:25,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 14:23:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-12-07 14:23:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2019-12-07 14:23:25,298 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 87 [2019-12-07 14:23:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:25,298 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2019-12-07 14:23:25,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2019-12-07 14:23:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:25,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:25,300 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:25,300 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1635005334, now seen corresponding path program 1 times [2019-12-07 14:23:25,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:25,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193723154] [2019-12-07 14:23:25,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:25,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193723154] [2019-12-07 14:23:25,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:25,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:25,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851843284] [2019-12-07 14:23:25,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:25,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:25,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:25,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:25,348 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand 4 states. [2019-12-07 14:23:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:25,649 INFO L93 Difference]: Finished difference Result 791 states and 1178 transitions. [2019-12-07 14:23:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:25,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:23:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:25,651 INFO L225 Difference]: With dead ends: 791 [2019-12-07 14:23:25,652 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 14:23:25,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 14:23:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-12-07 14:23:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 627 transitions. [2019-12-07 14:23:25,664 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 627 transitions. Word has length 87 [2019-12-07 14:23:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:25,664 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 627 transitions. [2019-12-07 14:23:25,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 627 transitions. [2019-12-07 14:23:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:25,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:25,666 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:25,666 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 513794263, now seen corresponding path program 2 times [2019-12-07 14:23:25,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:25,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307896545] [2019-12-07 14:23:25,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:25,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307896545] [2019-12-07 14:23:25,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:25,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:25,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008479303] [2019-12-07 14:23:25,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:25,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:25,733 INFO L87 Difference]: Start difference. First operand 418 states and 627 transitions. Second operand 4 states. [2019-12-07 14:23:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:25,995 INFO L93 Difference]: Finished difference Result 868 states and 1293 transitions. [2019-12-07 14:23:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:25,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:23:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:25,998 INFO L225 Difference]: With dead ends: 868 [2019-12-07 14:23:25,998 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 14:23:25,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 14:23:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-12-07 14:23:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 625 transitions. [2019-12-07 14:23:26,010 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 625 transitions. Word has length 87 [2019-12-07 14:23:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:26,010 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 625 transitions. [2019-12-07 14:23:26,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2019-12-07 14:23:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:26,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:26,012 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 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] [2019-12-07 14:23:26,012 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:26,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash 495138805, now seen corresponding path program 1 times [2019-12-07 14:23:26,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:26,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303323539] [2019-12-07 14:23:26,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:26,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303323539] [2019-12-07 14:23:26,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:26,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:26,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893356688] [2019-12-07 14:23:26,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:26,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:26,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:26,052 INFO L87 Difference]: Start difference. First operand 418 states and 625 transitions. Second operand 4 states. [2019-12-07 14:23:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:26,290 INFO L93 Difference]: Finished difference Result 868 states and 1289 transitions. [2019-12-07 14:23:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:26,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:23:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:26,293 INFO L225 Difference]: With dead ends: 868 [2019-12-07 14:23:26,293 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 14:23:26,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 14:23:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-12-07 14:23:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 623 transitions. [2019-12-07 14:23:26,300 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 623 transitions. Word has length 87 [2019-12-07 14:23:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:26,300 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 623 transitions. [2019-12-07 14:23:26,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 623 transitions. [2019-12-07 14:23:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:26,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:26,301 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:26,301 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash -210361832, now seen corresponding path program 1 times [2019-12-07 14:23:26,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:26,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490878243] [2019-12-07 14:23:26,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:26,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490878243] [2019-12-07 14:23:26,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:26,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:26,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693776018] [2019-12-07 14:23:26,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:26,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:26,347 INFO L87 Difference]: Start difference. First operand 418 states and 623 transitions. Second operand 4 states. [2019-12-07 14:23:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:26,634 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2019-12-07 14:23:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:26,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:23:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:26,636 INFO L225 Difference]: With dead ends: 719 [2019-12-07 14:23:26,636 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 14:23:26,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 14:23:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-12-07 14:23:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2019-12-07 14:23:26,643 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 87 [2019-12-07 14:23:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:26,644 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2019-12-07 14:23:26,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2019-12-07 14:23:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:23:26,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:26,645 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 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] [2019-12-07 14:23:26,645 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1668397004, now seen corresponding path program 1 times [2019-12-07 14:23:26,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:26,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843100110] [2019-12-07 14:23:26,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:26,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843100110] [2019-12-07 14:23:26,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:26,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:26,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203296324] [2019-12-07 14:23:26,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:26,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:26,686 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 4 states. [2019-12-07 14:23:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:26,994 INFO L93 Difference]: Finished difference Result 940 states and 1388 transitions. [2019-12-07 14:23:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:26,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:23:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:26,997 INFO L225 Difference]: With dead ends: 940 [2019-12-07 14:23:26,997 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 14:23:26,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 14:23:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-12-07 14:23:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2019-12-07 14:23:27,005 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 88 [2019-12-07 14:23:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:27,005 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2019-12-07 14:23:27,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2019-12-07 14:23:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:23:27,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:27,006 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:27,006 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash -570561745, now seen corresponding path program 1 times [2019-12-07 14:23:27,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:27,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655297150] [2019-12-07 14:23:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:27,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655297150] [2019-12-07 14:23:27,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:27,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:27,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023777414] [2019-12-07 14:23:27,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:27,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:27,044 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand 4 states. [2019-12-07 14:23:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:27,337 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2019-12-07 14:23:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:27,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:23:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:27,339 INFO L225 Difference]: With dead ends: 785 [2019-12-07 14:23:27,339 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 14:23:27,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 14:23:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-12-07 14:23:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 617 transitions. [2019-12-07 14:23:27,346 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 617 transitions. Word has length 88 [2019-12-07 14:23:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:27,346 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 617 transitions. [2019-12-07 14:23:27,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2019-12-07 14:23:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:23:27,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:27,347 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 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] [2019-12-07 14:23:27,348 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash 296589706, now seen corresponding path program 1 times [2019-12-07 14:23:27,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:27,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003094193] [2019-12-07 14:23:27,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:27,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003094193] [2019-12-07 14:23:27,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:27,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:27,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188307429] [2019-12-07 14:23:27,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:27,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:27,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:27,384 INFO L87 Difference]: Start difference. First operand 418 states and 617 transitions. Second operand 4 states. [2019-12-07 14:23:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:27,633 INFO L93 Difference]: Finished difference Result 868 states and 1273 transitions. [2019-12-07 14:23:27,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:27,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:23:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:27,635 INFO L225 Difference]: With dead ends: 868 [2019-12-07 14:23:27,635 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 14:23:27,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 14:23:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-12-07 14:23:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 615 transitions. [2019-12-07 14:23:27,643 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 615 transitions. Word has length 88 [2019-12-07 14:23:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:27,643 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 615 transitions. [2019-12-07 14:23:27,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 615 transitions. [2019-12-07 14:23:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:23:27,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:27,644 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:27,644 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1942369043, now seen corresponding path program 1 times [2019-12-07 14:23:27,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:27,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911398627] [2019-12-07 14:23:27,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:27,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911398627] [2019-12-07 14:23:27,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:27,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:27,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345964428] [2019-12-07 14:23:27,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:27,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:27,683 INFO L87 Difference]: Start difference. First operand 418 states and 615 transitions. Second operand 4 states. [2019-12-07 14:23:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:27,914 INFO L93 Difference]: Finished difference Result 713 states and 1043 transitions. [2019-12-07 14:23:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:27,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:23:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:27,916 INFO L225 Difference]: With dead ends: 713 [2019-12-07 14:23:27,916 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 14:23:27,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 14:23:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-12-07 14:23:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2019-12-07 14:23:27,922 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 88 [2019-12-07 14:23:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:27,923 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2019-12-07 14:23:27,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2019-12-07 14:23:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:23:27,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:27,924 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-12-07 14:23:27,924 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:27,924 INFO L82 PathProgramCache]: Analyzing trace with hash -233112104, now seen corresponding path program 1 times [2019-12-07 14:23:27,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:27,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82279710] [2019-12-07 14:23:27,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:27,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82279710] [2019-12-07 14:23:27,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526670377] [2019-12-07 14:23:27,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:27,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:27,960 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand 4 states. [2019-12-07 14:23:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:28,289 INFO L93 Difference]: Finished difference Result 934 states and 1365 transitions. [2019-12-07 14:23:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:28,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 14:23:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:28,292 INFO L225 Difference]: With dead ends: 934 [2019-12-07 14:23:28,292 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 14:23:28,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 14:23:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-12-07 14:23:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-12-07 14:23:28,302 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 89 [2019-12-07 14:23:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:28,303 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-12-07 14:23:28,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-12-07 14:23:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:23:28,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:28,304 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-12-07 14:23:28,304 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:28,305 INFO L82 PathProgramCache]: Analyzing trace with hash 190534618, now seen corresponding path program 1 times [2019-12-07 14:23:28,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:28,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254344189] [2019-12-07 14:23:28,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:28,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254344189] [2019-12-07 14:23:28,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:28,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:28,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443074603] [2019-12-07 14:23:28,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:28,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:28,348 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 4 states. [2019-12-07 14:23:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:28,573 INFO L93 Difference]: Finished difference Result 862 states and 1254 transitions. [2019-12-07 14:23:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:28,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 14:23:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:28,576 INFO L225 Difference]: With dead ends: 862 [2019-12-07 14:23:28,576 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 14:23:28,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 14:23:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-12-07 14:23:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 609 transitions. [2019-12-07 14:23:28,585 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 609 transitions. Word has length 89 [2019-12-07 14:23:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:28,585 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 609 transitions. [2019-12-07 14:23:28,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 609 transitions. [2019-12-07 14:23:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:23:28,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:28,587 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 14:23:28,587 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1591319919, now seen corresponding path program 1 times [2019-12-07 14:23:28,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:28,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166843650] [2019-12-07 14:23:28,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:28,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166843650] [2019-12-07 14:23:28,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:28,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:28,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143406360] [2019-12-07 14:23:28,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:28,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:28,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:28,631 INFO L87 Difference]: Start difference. First operand 418 states and 609 transitions. Second operand 4 states. [2019-12-07 14:23:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:28,897 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2019-12-07 14:23:28,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:28,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 14:23:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:28,899 INFO L225 Difference]: With dead ends: 916 [2019-12-07 14:23:28,899 INFO L226 Difference]: Without dead ends: 508 [2019-12-07 14:23:28,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-07 14:23:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-12-07 14:23:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 607 transitions. [2019-12-07 14:23:28,906 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 607 transitions. Word has length 90 [2019-12-07 14:23:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:28,906 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 607 transitions. [2019-12-07 14:23:28,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 607 transitions. [2019-12-07 14:23:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:23:28,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:28,907 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:28,908 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1012220386, now seen corresponding path program 1 times [2019-12-07 14:23:28,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:28,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899890892] [2019-12-07 14:23:28,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:28,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899890892] [2019-12-07 14:23:28,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:28,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:28,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421239947] [2019-12-07 14:23:28,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:28,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:28,948 INFO L87 Difference]: Start difference. First operand 418 states and 607 transitions. Second operand 4 states. [2019-12-07 14:23:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:29,265 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2019-12-07 14:23:29,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:29,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 14:23:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:29,268 INFO L225 Difference]: With dead ends: 916 [2019-12-07 14:23:29,268 INFO L226 Difference]: Without dead ends: 508 [2019-12-07 14:23:29,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-07 14:23:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-12-07 14:23:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2019-12-07 14:23:29,277 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 90 [2019-12-07 14:23:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:29,278 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2019-12-07 14:23:29,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2019-12-07 14:23:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:23:29,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:29,279 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 14:23:29,279 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1343173425, now seen corresponding path program 1 times [2019-12-07 14:23:29,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:29,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195663343] [2019-12-07 14:23:29,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:23:29,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195663343] [2019-12-07 14:23:29,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:29,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:29,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612083267] [2019-12-07 14:23:29,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:29,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:29,342 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand 4 states. [2019-12-07 14:23:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:29,539 INFO L93 Difference]: Finished difference Result 844 states and 1220 transitions. [2019-12-07 14:23:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:29,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 14:23:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:29,541 INFO L225 Difference]: With dead ends: 844 [2019-12-07 14:23:29,541 INFO L226 Difference]: Without dead ends: 436 [2019-12-07 14:23:29,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-12-07 14:23:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418. [2019-12-07 14:23:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 14:23:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 603 transitions. [2019-12-07 14:23:29,547 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 603 transitions. Word has length 90 [2019-12-07 14:23:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:29,547 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 603 transitions. [2019-12-07 14:23:29,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 603 transitions. [2019-12-07 14:23:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:23:29,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:29,548 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:29,548 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:29,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:29,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1260366880, now seen corresponding path program 1 times [2019-12-07 14:23:29,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:29,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134872282] [2019-12-07 14:23:29,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 14:23:29,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134872282] [2019-12-07 14:23:29,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:29,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:29,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926317510] [2019-12-07 14:23:29,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:29,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:29,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:29,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:29,585 INFO L87 Difference]: Start difference. First operand 418 states and 603 transitions. Second operand 3 states. [2019-12-07 14:23:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:29,611 INFO L93 Difference]: Finished difference Result 828 states and 1201 transitions. [2019-12-07 14:23:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:29,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-12-07 14:23:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:29,614 INFO L225 Difference]: With dead ends: 828 [2019-12-07 14:23:29,614 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 14:23:29,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 14:23:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-12-07 14:23:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 14:23:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 824 transitions. [2019-12-07 14:23:29,622 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 824 transitions. Word has length 90 [2019-12-07 14:23:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:29,622 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 824 transitions. [2019-12-07 14:23:29,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 824 transitions. [2019-12-07 14:23:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 14:23:29,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:29,624 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:29,624 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash -584407498, now seen corresponding path program 1 times [2019-12-07 14:23:29,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:29,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317154364] [2019-12-07 14:23:29,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 14:23:29,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317154364] [2019-12-07 14:23:29,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:29,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:29,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853246852] [2019-12-07 14:23:29,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:29,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:29,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:29,669 INFO L87 Difference]: Start difference. First operand 571 states and 824 transitions. Second operand 3 states. [2019-12-07 14:23:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:29,698 INFO L93 Difference]: Finished difference Result 726 states and 1049 transitions. [2019-12-07 14:23:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:29,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-12-07 14:23:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:29,702 INFO L225 Difference]: With dead ends: 726 [2019-12-07 14:23:29,702 INFO L226 Difference]: Without dead ends: 724 [2019-12-07 14:23:29,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-12-07 14:23:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-12-07 14:23:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-12-07 14:23:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1046 transitions. [2019-12-07 14:23:29,714 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1046 transitions. Word has length 92 [2019-12-07 14:23:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:29,714 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1046 transitions. [2019-12-07 14:23:29,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1046 transitions. [2019-12-07 14:23:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 14:23:29,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:29,716 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:29,716 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2019-12-07 14:23:29,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:29,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883640862] [2019-12-07 14:23:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:23:29,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883640862] [2019-12-07 14:23:29,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:29,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:29,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682391242] [2019-12-07 14:23:29,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:29,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:29,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:29,757 INFO L87 Difference]: Start difference. First operand 724 states and 1046 transitions. Second operand 3 states. [2019-12-07 14:23:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:29,776 INFO L93 Difference]: Finished difference Result 726 states and 1047 transitions. [2019-12-07 14:23:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:29,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-12-07 14:23:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:29,779 INFO L225 Difference]: With dead ends: 726 [2019-12-07 14:23:29,779 INFO L226 Difference]: Without dead ends: 724 [2019-12-07 14:23:29,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-12-07 14:23:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-12-07 14:23:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-12-07 14:23:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1045 transitions. [2019-12-07 14:23:29,788 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1045 transitions. Word has length 113 [2019-12-07 14:23:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:29,789 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1045 transitions. [2019-12-07 14:23:29,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1045 transitions. [2019-12-07 14:23:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 14:23:29,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:29,790 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:29,790 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2019-12-07 14:23:29,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:29,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988118341] [2019-12-07 14:23:29,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:23:29,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988118341] [2019-12-07 14:23:29,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:29,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:29,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684357824] [2019-12-07 14:23:29,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:29,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:29,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:29,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:29,842 INFO L87 Difference]: Start difference. First operand 724 states and 1045 transitions. Second operand 4 states. [2019-12-07 14:23:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:30,082 INFO L93 Difference]: Finished difference Result 1695 states and 2458 transitions. [2019-12-07 14:23:30,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:30,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 14:23:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:30,086 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 14:23:30,086 INFO L226 Difference]: Without dead ends: 981 [2019-12-07 14:23:30,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-07 14:23:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-12-07 14:23:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-12-07 14:23:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1255 transitions. [2019-12-07 14:23:30,099 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1255 transitions. Word has length 115 [2019-12-07 14:23:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:30,099 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1255 transitions. [2019-12-07 14:23:30,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1255 transitions. [2019-12-07 14:23:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:23:30,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:30,100 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:30,101 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2019-12-07 14:23:30,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:30,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421936945] [2019-12-07 14:23:30,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:23:30,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421936945] [2019-12-07 14:23:30,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:30,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:30,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883727463] [2019-12-07 14:23:30,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:30,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:30,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:30,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:30,147 INFO L87 Difference]: Start difference. First operand 844 states and 1255 transitions. Second operand 4 states. [2019-12-07 14:23:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:30,391 INFO L93 Difference]: Finished difference Result 1810 states and 2658 transitions. [2019-12-07 14:23:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:30,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 14:23:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:30,395 INFO L225 Difference]: With dead ends: 1810 [2019-12-07 14:23:30,395 INFO L226 Difference]: Without dead ends: 976 [2019-12-07 14:23:30,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-07 14:23:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-12-07 14:23:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-12-07 14:23:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1250 transitions. [2019-12-07 14:23:30,408 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1250 transitions. Word has length 130 [2019-12-07 14:23:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:30,409 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1250 transitions. [2019-12-07 14:23:30,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1250 transitions. [2019-12-07 14:23:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:23:30,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:30,410 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 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] [2019-12-07 14:23:30,410 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2019-12-07 14:23:30,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:30,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025298308] [2019-12-07 14:23:30,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:23:30,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025298308] [2019-12-07 14:23:30,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:30,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:30,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447221485] [2019-12-07 14:23:30,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:30,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:30,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:30,452 INFO L87 Difference]: Start difference. First operand 844 states and 1250 transitions. Second operand 4 states. [2019-12-07 14:23:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:30,687 INFO L93 Difference]: Finished difference Result 1810 states and 2648 transitions. [2019-12-07 14:23:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:30,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 14:23:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:30,691 INFO L225 Difference]: With dead ends: 1810 [2019-12-07 14:23:30,691 INFO L226 Difference]: Without dead ends: 976 [2019-12-07 14:23:30,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-07 14:23:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-12-07 14:23:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-12-07 14:23:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1245 transitions. [2019-12-07 14:23:30,703 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1245 transitions. Word has length 130 [2019-12-07 14:23:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:30,704 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1245 transitions. [2019-12-07 14:23:30,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1245 transitions. [2019-12-07 14:23:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:23:30,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:30,705 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:30,705 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2019-12-07 14:23:30,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:30,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262715813] [2019-12-07 14:23:30,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:23:30,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262715813] [2019-12-07 14:23:30,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:30,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:30,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914785277] [2019-12-07 14:23:30,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:30,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:30,751 INFO L87 Difference]: Start difference. First operand 844 states and 1245 transitions. Second operand 4 states. [2019-12-07 14:23:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:30,979 INFO L93 Difference]: Finished difference Result 1641 states and 2428 transitions. [2019-12-07 14:23:30,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:30,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 14:23:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:30,983 INFO L225 Difference]: With dead ends: 1641 [2019-12-07 14:23:30,983 INFO L226 Difference]: Without dead ends: 982 [2019-12-07 14:23:30,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-07 14:23:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-12-07 14:23:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-07 14:23:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1365 transitions. [2019-12-07 14:23:30,996 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1365 transitions. Word has length 130 [2019-12-07 14:23:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:30,996 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1365 transitions. [2019-12-07 14:23:30,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1365 transitions. [2019-12-07 14:23:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 14:23:30,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:30,998 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 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] [2019-12-07 14:23:30,998 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2019-12-07 14:23:30,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:30,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264000301] [2019-12-07 14:23:30,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:23:31,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264000301] [2019-12-07 14:23:31,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:31,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:31,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997392212] [2019-12-07 14:23:31,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:31,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:31,050 INFO L87 Difference]: Start difference. First operand 916 states and 1365 transitions. Second operand 4 states. [2019-12-07 14:23:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:31,279 INFO L93 Difference]: Finished difference Result 1954 states and 2878 transitions. [2019-12-07 14:23:31,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:31,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 14:23:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:31,284 INFO L225 Difference]: With dead ends: 1954 [2019-12-07 14:23:31,284 INFO L226 Difference]: Without dead ends: 1048 [2019-12-07 14:23:31,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-07 14:23:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-12-07 14:23:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-07 14:23:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1360 transitions. [2019-12-07 14:23:31,298 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1360 transitions. Word has length 131 [2019-12-07 14:23:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:31,298 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1360 transitions. [2019-12-07 14:23:31,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1360 transitions. [2019-12-07 14:23:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 14:23:31,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:31,300 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 14:23:31,300 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:31,300 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2019-12-07 14:23:31,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:31,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454476095] [2019-12-07 14:23:31,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:23:31,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454476095] [2019-12-07 14:23:31,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:31,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:31,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513581343] [2019-12-07 14:23:31,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:31,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:31,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:31,345 INFO L87 Difference]: Start difference. First operand 916 states and 1360 transitions. Second operand 4 states. [2019-12-07 14:23:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:31,573 INFO L93 Difference]: Finished difference Result 1954 states and 2868 transitions. [2019-12-07 14:23:31,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:31,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 14:23:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:31,577 INFO L225 Difference]: With dead ends: 1954 [2019-12-07 14:23:31,577 INFO L226 Difference]: Without dead ends: 1048 [2019-12-07 14:23:31,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-07 14:23:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-12-07 14:23:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-07 14:23:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1355 transitions. [2019-12-07 14:23:31,590 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1355 transitions. Word has length 132 [2019-12-07 14:23:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:31,590 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1355 transitions. [2019-12-07 14:23:31,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1355 transitions. [2019-12-07 14:23:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 14:23:31,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:31,592 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 14:23:31,592 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:31,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2019-12-07 14:23:31,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:31,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351451575] [2019-12-07 14:23:31,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:23:31,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351451575] [2019-12-07 14:23:31,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:31,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:31,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26602659] [2019-12-07 14:23:31,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:31,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:31,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:31,633 INFO L87 Difference]: Start difference. First operand 916 states and 1355 transitions. Second operand 4 states. [2019-12-07 14:23:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:31,860 INFO L93 Difference]: Finished difference Result 1909 states and 2803 transitions. [2019-12-07 14:23:31,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:31,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 14:23:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:31,864 INFO L225 Difference]: With dead ends: 1909 [2019-12-07 14:23:31,864 INFO L226 Difference]: Without dead ends: 1003 [2019-12-07 14:23:31,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-12-07 14:23:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-12-07 14:23:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-07 14:23:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1350 transitions. [2019-12-07 14:23:31,877 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1350 transitions. Word has length 133 [2019-12-07 14:23:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:31,877 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1350 transitions. [2019-12-07 14:23:31,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1350 transitions. [2019-12-07 14:23:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 14:23:31,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:31,879 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:31,879 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 487188268, now seen corresponding path program 1 times [2019-12-07 14:23:31,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:31,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696341651] [2019-12-07 14:23:31,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-12-07 14:23:31,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696341651] [2019-12-07 14:23:31,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:31,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:31,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951977683] [2019-12-07 14:23:31,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:31,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:31,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:31,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:31,928 INFO L87 Difference]: Start difference. First operand 916 states and 1350 transitions. Second operand 4 states. [2019-12-07 14:23:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:32,168 INFO L93 Difference]: Finished difference Result 2054 states and 3033 transitions. [2019-12-07 14:23:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:32,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 14:23:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:32,173 INFO L225 Difference]: With dead ends: 2054 [2019-12-07 14:23:32,173 INFO L226 Difference]: Without dead ends: 1148 [2019-12-07 14:23:32,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-12-07 14:23:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-12-07 14:23:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-12-07 14:23:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1540 transitions. [2019-12-07 14:23:32,193 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1540 transitions. Word has length 133 [2019-12-07 14:23:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:32,193 INFO L462 AbstractCegarLoop]: Abstraction has 1026 states and 1540 transitions. [2019-12-07 14:23:32,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1540 transitions. [2019-12-07 14:23:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 14:23:32,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:32,195 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:32,195 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-12-07 14:23:32,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:32,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606282369] [2019-12-07 14:23:32,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:23:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:23:32,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:23:32,498 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:23:32,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:23:32 BoogieIcfgContainer [2019-12-07 14:23:32,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:23:32,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:23:32,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:23:32,572 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:23:32,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:21" (3/4) ... [2019-12-07 14:23:32,575 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:23:32,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:23:32,577 INFO L168 Benchmark]: Toolchain (without parser) took 12301.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -237.0 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:32,577 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:32,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:32,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:32,578 INFO L168 Benchmark]: Boogie Preprocessor took 55.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:32,578 INFO L168 Benchmark]: RCFGBuilder took 656.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.8 MB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:32,578 INFO L168 Benchmark]: TraceAbstraction took 11121.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 972.8 MB in the beginning and 1.2 GB in the end (delta: -198.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:32,579 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:32,580 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 656.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.8 MB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11121.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 972.8 MB in the beginning and 1.2 GB in the end (delta: -198.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1644]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1329. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1109] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1110] EXPR s->info_callback [L1110] cb = s->info_callback [L1118] EXPR s->in_handshake [L1118] s->in_handshake += 1 [L1119] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND TRUE s->state == 12292 [L1235] s->new_session = 1 [L1236] s->state = 4096 [L1237] EXPR s->ctx [L1237] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1237] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1242] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1243] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1248] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1248] COND FALSE !((s->version & 65280) != 768) [L1254] s->type = 4096 [L1255] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1255] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1267] tmp___4 = __VERIFIER_nondet_int() [L1268] COND FALSE !(! tmp___4) [L1274] tmp___5 = __VERIFIER_nondet_int() [L1275] COND FALSE !(! tmp___5) [L1281] s->state = 4368 [L1282] EXPR s->ctx [L1282] EXPR (s->ctx)->stats.sess_connect [L1282] (s->ctx)->stats.sess_connect += 1 [L1283] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND TRUE s->state == 4368 [L1287] s->shutdown = 0 [L1288] ret = __VERIFIER_nondet_int() [L1289] COND TRUE blastFlag == 0 [L1290] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1294] COND FALSE !(ret <= 0) [L1299] s->state = 4384 [L1300] s->init_num = 0 [L1301] EXPR s->bbio [L1301] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1301] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND TRUE s->state == 4384 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND TRUE blastFlag == 1 [L1311] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1315] COND FALSE !(ret <= 0) [L1320] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1320] COND FALSE !(s->hit) [L1323] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1325] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND TRUE s->state == 4400 [L1329] EXPR s->s3 [L1329] EXPR (s->s3)->tmp.new_cipher [L1329] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1329] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1332] ret = __VERIFIER_nondet_int() [L1333] COND TRUE blastFlag == 2 [L1334] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1338] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1344] s->state = 4416 [L1345] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND TRUE s->state == 4416 [L1349] ret = __VERIFIER_nondet_int() [L1350] COND TRUE blastFlag == 3 [L1351] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1355] COND FALSE !(ret <= 0) [L1360] s->state = 4432 [L1361] s->init_num = 0 [L1362] tmp___6 = __VERIFIER_nondet_int() [L1363] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1171] COND TRUE s->state == 4432 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={9:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->state = 4448 [L1384] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1171] COND FALSE !(s->state == 4432) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1174] COND FALSE !(s->state == 4433) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1177] COND TRUE s->state == 4448 [L1388] ret = __VERIFIER_nondet_int() [L1389] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1644] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 35, TraceHistogramMax: 7, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7208 SDtfs, 2447 SDslu, 9311 SDs, 0 SdLazy, 5221 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 68 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3100 ConstructedInterpolants, 0 QuantifiedInterpolants, 675721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 3328/3328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:23:34,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:23:34,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:23:34,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:23:34,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:23:34,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:23:34,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:23:34,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:23:34,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:23:34,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:23:34,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:23:34,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:23:34,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:23:34,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:23:34,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:23:34,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:23:34,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:23:34,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:23:34,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:23:34,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:23:34,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:23:34,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:23:34,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:23:34,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:23:34,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:23:34,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:23:34,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:23:34,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:23:34,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:23:34,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:23:34,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:23:34,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:23:34,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:23:34,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:23:34,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:23:34,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:23:34,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:23:34,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:23:34,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:23:34,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:23:34,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:23:34,043 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 14:23:34,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:23:34,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:23:34,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:23:34,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:23:34,055 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:23:34,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:23:34,055 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:23:34,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:23:34,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:23:34,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:23:34,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:23:34,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:23:34,056 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:23:34,056 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:23:34,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:23:34,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:23:34,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:23:34,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:23:34,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:23:34,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:23:34,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:23:34,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:23:34,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:34,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:23:34,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:23:34,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:23:34,058 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 14:23:34,058 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:23:34,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:23:34,059 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:23:34,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:23:34,059 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer 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(__VERIFIER_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 -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-12-07 14:23:34,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:23:34,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:23:34,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:23:34,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:23:34,253 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:23:34,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-12-07 14:23:34,291 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/f19e4ec6a/a35161e1a674468b8c8f5093cb4777cd/FLAG36aa55cae [2019-12-07 14:23:34,785 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:23:34,785 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-12-07 14:23:34,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/f19e4ec6a/a35161e1a674468b8c8f5093cb4777cd/FLAG36aa55cae [2019-12-07 14:23:34,806 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/data/f19e4ec6a/a35161e1a674468b8c8f5093cb4777cd [2019-12-07 14:23:34,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:23:34,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:23:34,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:34,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:23:34,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:23:34,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:34" (1/1) ... [2019-12-07 14:23:34,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d795c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:34, skipping insertion in model container [2019-12-07 14:23:34,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:34" (1/1) ... [2019-12-07 14:23:34,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:23:34,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:23:35,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:35,136 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:23:35,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:35,218 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:23:35,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35 WrapperNode [2019-12-07 14:23:35,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:35,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:35,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:23:35,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:23:35,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:35,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:23:35,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:23:35,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:23:35,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... [2019-12-07 14:23:35,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:23:35,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:23:35,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:23:35,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:23:35,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:23:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:23:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:23:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:23:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:23:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:23:35,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:23:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:23:35,516 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:23:37,317 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 14:23:37,317 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 14:23:37,318 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:23:37,318 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:23:37,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:37 BoogieIcfgContainer [2019-12-07 14:23:37,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:23:37,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:23:37,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:23:37,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:23:37,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:23:34" (1/3) ... [2019-12-07 14:23:37,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de0a0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:37, skipping insertion in model container [2019-12-07 14:23:37,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:35" (2/3) ... [2019-12-07 14:23:37,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de0a0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:37, skipping insertion in model container [2019-12-07 14:23:37,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:37" (3/3) ... [2019-12-07 14:23:37,324 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-12-07 14:23:37,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:23:37,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:23:37,343 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:23:37,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:23:37,359 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:23:37,359 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:23:37,359 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:23:37,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:23:37,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:23:37,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:23:37,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:23:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-12-07 14:23:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:23:37,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:37,377 INFO L410 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] [2019-12-07 14:23:37,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-12-07 14:23:37,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:23:37,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160495149] [2019-12-07 14:23:37,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:37,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:23:37,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:37,530 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:37,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160495149] [2019-12-07 14:23:37,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:37,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:23:37,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814871630] [2019-12-07 14:23:37,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:37,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:23:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:37,559 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-12-07 14:23:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:37,637 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-12-07 14:23:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:37,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 14:23:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:37,648 INFO L225 Difference]: With dead ends: 375 [2019-12-07 14:23:37,648 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 14:23:37,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 14:23:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-12-07 14:23:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 14:23:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2019-12-07 14:23:37,693 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 24 [2019-12-07 14:23:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:37,693 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2019-12-07 14:23:37,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2019-12-07 14:23:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:23:37,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:37,695 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:37,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:23:37,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:37,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1495258694, now seen corresponding path program 1 times [2019-12-07 14:23:37,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:23:37,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014643689] [2019-12-07 14:23:37,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:38,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:23:38,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:38,094 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:38,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014643689] [2019-12-07 14:23:38,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:38,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:23:38,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200212762] [2019-12-07 14:23:38,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:38,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:23:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:38,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:38,110 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand 4 states. [2019-12-07 14:23:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:39,882 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2019-12-07 14:23:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:39,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 14:23:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:39,886 INFO L225 Difference]: With dead ends: 528 [2019-12-07 14:23:39,886 INFO L226 Difference]: Without dead ends: 421 [2019-12-07 14:23:39,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-07 14:23:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-12-07 14:23:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-07 14:23:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-12-07 14:23:39,909 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 41 [2019-12-07 14:23:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:39,910 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-12-07 14:23:39,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-12-07 14:23:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:23:39,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:39,914 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:40,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:23:40,115 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 924360661, now seen corresponding path program 1 times [2019-12-07 14:23:40,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:23:40,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648760297] [2019-12-07 14:23:40,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:40,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:23:40,268 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:23:40,280 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:23:40,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648760297] [2019-12-07 14:23:40,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:40,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:23:40,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10131979] [2019-12-07 14:23:40,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:40,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:23:40,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:40,298 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-12-07 14:23:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:42,366 INFO L93 Difference]: Finished difference Result 939 states and 1394 transitions. [2019-12-07 14:23:42,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:42,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 14:23:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:42,370 INFO L225 Difference]: With dead ends: 939 [2019-12-07 14:23:42,370 INFO L226 Difference]: Without dead ends: 628 [2019-12-07 14:23:42,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-12-07 14:23:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-12-07 14:23:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-12-07 14:23:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2019-12-07 14:23:42,395 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 80 [2019-12-07 14:23:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:42,396 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2019-12-07 14:23:42,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2019-12-07 14:23:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 14:23:42,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:42,401 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:42,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:23:42,605 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2019-12-07 14:23:42,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:23:42,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309726950] [2019-12-07 14:23:42,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:42,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:23:42,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:09,352 WARN L192 SmtUtils]: Spent 26.50 s on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-12-07 14:24:09,353 INFO L343 Elim1Store]: treesize reduction 140, result has 40.9 percent of original size [2019-12-07 14:24:09,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 106 [2019-12-07 14:24:09,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:25,758 WARN L192 SmtUtils]: Spent 16.40 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 14:24:25,759 INFO L614 ElimStorePlain]: treesize reduction 18, result has 83.0 percent of original size [2019-12-07 14:24:25,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:25,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:25,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:25,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:25,767 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:9 [2019-12-07 14:24:25,793 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:24:25,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 14:24:25,794 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:25,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:25,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:25,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2019-12-07 14:24:25,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-12-07 14:24:25,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:25,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:25,803 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:25,803 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-12-07 14:24:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 14:24:25,821 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 14:24:25,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309726950] [2019-12-07 14:24:25,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:25,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:24:25,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119091368] [2019-12-07 14:24:25,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:24:25,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:24:25,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:24:25,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:24:25,842 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand 4 states. [2019-12-07 14:24:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:28,438 INFO L93 Difference]: Finished difference Result 1253 states and 1848 transitions. [2019-12-07 14:24:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:24:28,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 14:24:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:28,443 INFO L225 Difference]: With dead ends: 1253 [2019-12-07 14:24:28,443 INFO L226 Difference]: Without dead ends: 632 [2019-12-07 14:24:28,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:24:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-12-07 14:24:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 631. [2019-12-07 14:24:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-07 14:24:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 930 transitions. [2019-12-07 14:24:28,462 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 930 transitions. Word has length 100 [2019-12-07 14:24:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:28,463 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 930 transitions. [2019-12-07 14:24:28,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:24:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 930 transitions. [2019-12-07 14:24:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 14:24:28,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:28,465 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:28,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:24:28,666 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:28,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash 517833024, now seen corresponding path program 1 times [2019-12-07 14:24:28,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:24:28,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627526950] [2019-12-07 14:24:28,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:28,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:28,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:28,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:28,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:28,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:28,978 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:28,978 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:24:29,000 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:24:29,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:29,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:29,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:29,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:29,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 14:24:29,030 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:24:29,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:24:29,030 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:29,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:29,032 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:29,032 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:24:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 14:24:29,051 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 14:24:29,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627526950] [2019-12-07 14:24:29,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:29,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 14:24:29,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265968128] [2019-12-07 14:24:29,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:24:29,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:24:29,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:24:29,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:24:29,090 INFO L87 Difference]: Start difference. First operand 631 states and 930 transitions. Second operand 7 states. [2019-12-07 14:24:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:40,063 INFO L93 Difference]: Finished difference Result 2267 states and 3362 transitions. [2019-12-07 14:24:40,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:24:40,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-12-07 14:24:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:40,074 INFO L225 Difference]: With dead ends: 2267 [2019-12-07 14:24:40,074 INFO L226 Difference]: Without dead ends: 1646 [2019-12-07 14:24:40,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:24:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-12-07 14:24:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 756. [2019-12-07 14:24:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-12-07 14:24:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1139 transitions. [2019-12-07 14:24:40,105 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1139 transitions. Word has length 115 [2019-12-07 14:24:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:40,106 INFO L462 AbstractCegarLoop]: Abstraction has 756 states and 1139 transitions. [2019-12-07 14:24:40,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:24:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1139 transitions. [2019-12-07 14:24:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 14:24:40,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:40,107 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:40,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:24:40,309 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2019-12-07 14:24:40,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:24:40,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644171440] [2019-12-07 14:24:40,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:40,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:24:40,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:40,631 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:24:40,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:24:40,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:40,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:40,639 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:40,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:24:40,655 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:24:40,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:24:40,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:40,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:40,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:40,657 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:24:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:24:40,673 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:24:40,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644171440] [2019-12-07 14:24:40,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:40,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 14:24:40,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485890396] [2019-12-07 14:24:40,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:24:40,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:24:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:24:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:24:40,695 INFO L87 Difference]: Start difference. First operand 756 states and 1139 transitions. Second operand 5 states. [2019-12-07 14:24:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:43,428 INFO L93 Difference]: Finished difference Result 1760 states and 2637 transitions. [2019-12-07 14:24:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:24:43,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-12-07 14:24:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:43,436 INFO L225 Difference]: With dead ends: 1760 [2019-12-07 14:24:43,436 INFO L226 Difference]: Without dead ends: 1014 [2019-12-07 14:24:43,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:24:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-12-07 14:24:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 876. [2019-12-07 14:24:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-12-07 14:24:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1344 transitions. [2019-12-07 14:24:43,459 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1344 transitions. Word has length 115 [2019-12-07 14:24:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:43,459 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1344 transitions. [2019-12-07 14:24:43,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:24:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1344 transitions. [2019-12-07 14:24:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:24:43,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:43,461 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:43,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:24:43,662 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2019-12-07 14:24:43,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:24:43,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511976716] [2019-12-07 14:24:43,664 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:44,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:24:44,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:24:44,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:24:44,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:44,055 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:24:44,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:24:44,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:44,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:44,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:44,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:24:44,076 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:24:44,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:24:44,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:44,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:44,079 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:44,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:24:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:24:44,093 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:24:44,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511976716] [2019-12-07 14:24:44,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:44,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:24:44,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896249927] [2019-12-07 14:24:44,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:24:44,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:24:44,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:24:44,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:24:44,120 INFO L87 Difference]: Start difference. First operand 876 states and 1344 transitions. Second operand 6 states. [2019-12-07 14:24:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:52,033 INFO L93 Difference]: Finished difference Result 2396 states and 3610 transitions. [2019-12-07 14:24:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:24:52,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-12-07 14:24:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:52,040 INFO L225 Difference]: With dead ends: 2396 [2019-12-07 14:24:52,041 INFO L226 Difference]: Without dead ends: 1530 [2019-12-07 14:24:52,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:24:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2019-12-07 14:24:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 931. [2019-12-07 14:24:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-07 14:24:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1413 transitions. [2019-12-07 14:24:52,067 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1413 transitions. Word has length 130 [2019-12-07 14:24:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:52,067 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1413 transitions. [2019-12-07 14:24:52,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:24:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1413 transitions. [2019-12-07 14:24:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:24:52,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:52,069 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 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] [2019-12-07 14:24:52,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:24:52,270 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:52,270 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2019-12-07 14:24:52,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:24:52,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752754587] [2019-12-07 14:24:52,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:52,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:24:52,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:52,580 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:24:52,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:24:52,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:52,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:52,591 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:52,591 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:24:52,608 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:24:52,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:24:52,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:52,610 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:52,610 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:52,610 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:24:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:24:52,626 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:24:52,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752754587] [2019-12-07 14:24:52,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:52,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:24:52,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069297415] [2019-12-07 14:24:52,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:24:52,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:24:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:24:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:24:52,660 INFO L87 Difference]: Start difference. First operand 931 states and 1413 transitions. Second operand 6 states. [2019-12-07 14:25:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:02,195 INFO L93 Difference]: Finished difference Result 2452 states and 3664 transitions. [2019-12-07 14:25:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:02,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-12-07 14:25:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:02,204 INFO L225 Difference]: With dead ends: 2452 [2019-12-07 14:25:02,204 INFO L226 Difference]: Without dead ends: 1531 [2019-12-07 14:25:02,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-12-07 14:25:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 936. [2019-12-07 14:25:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-12-07 14:25:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1407 transitions. [2019-12-07 14:25:02,238 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1407 transitions. Word has length 130 [2019-12-07 14:25:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:02,238 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 1407 transitions. [2019-12-07 14:25:02,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1407 transitions. [2019-12-07 14:25:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:25:02,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:02,240 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:02,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:25:02,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2019-12-07 14:25:02,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:02,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635949465] [2019-12-07 14:25:02,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:02,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:02,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:02,757 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:02,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:02,758 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:02,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:02,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:02,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:02,780 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:02,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:02,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:02,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:02,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:02,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:02,798 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:02,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635949465] [2019-12-07 14:25:02,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:02,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:02,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847168239] [2019-12-07 14:25:02,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:02,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:02,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:02,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:02,826 INFO L87 Difference]: Start difference. First operand 936 states and 1407 transitions. Second operand 6 states. [2019-12-07 14:25:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:12,102 INFO L93 Difference]: Finished difference Result 2419 states and 3597 transitions. [2019-12-07 14:25:12,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:12,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-12-07 14:25:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:12,109 INFO L225 Difference]: With dead ends: 2419 [2019-12-07 14:25:12,109 INFO L226 Difference]: Without dead ends: 1651 [2019-12-07 14:25:12,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-12-07 14:25:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1052. [2019-12-07 14:25:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-12-07 14:25:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1581 transitions. [2019-12-07 14:25:12,136 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1581 transitions. Word has length 130 [2019-12-07 14:25:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:12,136 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1581 transitions. [2019-12-07 14:25:12,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1581 transitions. [2019-12-07 14:25:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 14:25:12,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:12,138 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 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] [2019-12-07 14:25:12,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:25:12,339 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:12,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:12,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2019-12-07 14:25:12,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:12,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954001338] [2019-12-07 14:25:12,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:12,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:12,680 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:12,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:12,680 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:12,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:12,688 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:12,688 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:12,702 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:12,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:12,703 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:12,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:12,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:12,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:12,719 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:12,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954001338] [2019-12-07 14:25:12,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:12,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:12,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905646269] [2019-12-07 14:25:12,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:12,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:12,746 INFO L87 Difference]: Start difference. First operand 1052 states and 1581 transitions. Second operand 6 states. [2019-12-07 14:25:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:19,644 INFO L93 Difference]: Finished difference Result 2669 states and 3950 transitions. [2019-12-07 14:25:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:19,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-12-07 14:25:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:19,652 INFO L225 Difference]: With dead ends: 2669 [2019-12-07 14:25:19,652 INFO L226 Difference]: Without dead ends: 1627 [2019-12-07 14:25:19,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-12-07 14:25:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1052. [2019-12-07 14:25:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-12-07 14:25:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1559 transitions. [2019-12-07 14:25:19,687 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1559 transitions. Word has length 131 [2019-12-07 14:25:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:19,687 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1559 transitions. [2019-12-07 14:25:19,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1559 transitions. [2019-12-07 14:25:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 14:25:19,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:19,689 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:19,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:25:19,891 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1695627015, now seen corresponding path program 1 times [2019-12-07 14:25:19,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:19,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682393703] [2019-12-07 14:25:19,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:20,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:20,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:20,199 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:20,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:20,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:20,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:20,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:20,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:20,222 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:20,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:20,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:20,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:20,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:20,224 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:20,240 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:20,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682393703] [2019-12-07 14:25:20,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:20,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:20,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652678264] [2019-12-07 14:25:20,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:20,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:20,268 INFO L87 Difference]: Start difference. First operand 1052 states and 1559 transitions. Second operand 6 states. [2019-12-07 14:25:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:27,039 INFO L93 Difference]: Finished difference Result 2484 states and 3649 transitions. [2019-12-07 14:25:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:27,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-12-07 14:25:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:27,046 INFO L225 Difference]: With dead ends: 2484 [2019-12-07 14:25:27,046 INFO L226 Difference]: Without dead ends: 1620 [2019-12-07 14:25:27,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2019-12-07 14:25:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1063. [2019-12-07 14:25:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2019-12-07 14:25:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1565 transitions. [2019-12-07 14:25:27,072 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1565 transitions. Word has length 131 [2019-12-07 14:25:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:27,072 INFO L462 AbstractCegarLoop]: Abstraction has 1063 states and 1565 transitions. [2019-12-07 14:25:27,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1565 transitions. [2019-12-07 14:25:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 14:25:27,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:27,074 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 14:25:27,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:25:27,275 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:27,275 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2019-12-07 14:25:27,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:27,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343258845] [2019-12-07 14:25:27,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:27,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:27,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:27,600 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:27,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:27,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:27,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:27,608 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:27,608 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:27,621 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:27,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:27,621 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:27,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:27,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:27,623 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:27,638 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:27,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343258845] [2019-12-07 14:25:27,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:27,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:27,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388246769] [2019-12-07 14:25:27,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:27,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:27,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:27,667 INFO L87 Difference]: Start difference. First operand 1063 states and 1565 transitions. Second operand 6 states. [2019-12-07 14:25:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:31,527 INFO L93 Difference]: Finished difference Result 2672 states and 3892 transitions. [2019-12-07 14:25:31,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:31,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-12-07 14:25:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:31,534 INFO L225 Difference]: With dead ends: 2672 [2019-12-07 14:25:31,534 INFO L226 Difference]: Without dead ends: 1619 [2019-12-07 14:25:31,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2019-12-07 14:25:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1063. [2019-12-07 14:25:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2019-12-07 14:25:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1543 transitions. [2019-12-07 14:25:31,565 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1543 transitions. Word has length 132 [2019-12-07 14:25:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:31,565 INFO L462 AbstractCegarLoop]: Abstraction has 1063 states and 1543 transitions. [2019-12-07 14:25:31,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1543 transitions. [2019-12-07 14:25:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 14:25:31,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:31,567 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 14:25:31,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:25:31,768 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:31,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2019-12-07 14:25:31,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:31,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383965642] [2019-12-07 14:25:31,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:32,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:32,161 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:32,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:32,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:32,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:32,190 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:32,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:32,191 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:32,193 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:32,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:32,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383965642] [2019-12-07 14:25:32,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:32,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:32,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533255846] [2019-12-07 14:25:32,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:32,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:32,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:32,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:32,261 INFO L87 Difference]: Start difference. First operand 1063 states and 1543 transitions. Second operand 6 states. [2019-12-07 14:25:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:40,147 INFO L93 Difference]: Finished difference Result 2627 states and 3793 transitions. [2019-12-07 14:25:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:40,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-12-07 14:25:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:40,154 INFO L225 Difference]: With dead ends: 2627 [2019-12-07 14:25:40,154 INFO L226 Difference]: Without dead ends: 1574 [2019-12-07 14:25:40,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-12-07 14:25:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1063. [2019-12-07 14:25:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2019-12-07 14:25:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1521 transitions. [2019-12-07 14:25:40,180 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1521 transitions. Word has length 133 [2019-12-07 14:25:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:40,181 INFO L462 AbstractCegarLoop]: Abstraction has 1063 states and 1521 transitions. [2019-12-07 14:25:40,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1521 transitions. [2019-12-07 14:25:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 14:25:40,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:40,182 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:40,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:25:40,383 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash -197856968, now seen corresponding path program 1 times [2019-12-07 14:25:40,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:40,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457092818] [2019-12-07 14:25:40,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:40,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:40,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:40,717 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:40,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:40,718 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:40,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:40,725 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:40,725 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:40,740 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:40,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:40,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:40,741 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:40,742 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:40,742 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:40,760 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:40,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457092818] [2019-12-07 14:25:40,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335351412] [2019-12-07 14:25:40,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:40,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:40,788 INFO L87 Difference]: Start difference. First operand 1063 states and 1521 transitions. Second operand 6 states. [2019-12-07 14:25:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:49,598 INFO L93 Difference]: Finished difference Result 2727 states and 3884 transitions. [2019-12-07 14:25:49,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:49,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-12-07 14:25:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:49,606 INFO L225 Difference]: With dead ends: 2727 [2019-12-07 14:25:49,606 INFO L226 Difference]: Without dead ends: 1674 [2019-12-07 14:25:49,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-12-07 14:25:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1158. [2019-12-07 14:25:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-12-07 14:25:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1635 transitions. [2019-12-07 14:25:49,636 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1635 transitions. Word has length 133 [2019-12-07 14:25:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:49,636 INFO L462 AbstractCegarLoop]: Abstraction has 1158 states and 1635 transitions. [2019-12-07 14:25:49,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1635 transitions. [2019-12-07 14:25:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 14:25:49,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:49,637 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:49,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 14:25:49,838 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash 584684213, now seen corresponding path program 1 times [2019-12-07 14:25:49,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:49,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879575882] [2019-12-07 14:25:49,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:50,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:50,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:50,168 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:50,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:50,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:50,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:50,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:50,176 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:50,189 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:50,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:50,189 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:50,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:50,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:50,191 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:50,209 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:50,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879575882] [2019-12-07 14:25:50,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:50,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:50,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188141807] [2019-12-07 14:25:50,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:50,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:50,239 INFO L87 Difference]: Start difference. First operand 1158 states and 1635 transitions. Second operand 6 states. [2019-12-07 14:25:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:57,033 INFO L93 Difference]: Finished difference Result 2781 states and 3928 transitions. [2019-12-07 14:25:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:57,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-12-07 14:25:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:57,040 INFO L225 Difference]: With dead ends: 2781 [2019-12-07 14:25:57,040 INFO L226 Difference]: Without dead ends: 1633 [2019-12-07 14:25:57,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-12-07 14:25:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1174. [2019-12-07 14:25:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-07 14:25:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1656 transitions. [2019-12-07 14:25:57,071 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1656 transitions. Word has length 134 [2019-12-07 14:25:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:57,071 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1656 transitions. [2019-12-07 14:25:57,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1656 transitions. [2019-12-07 14:25:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 14:25:57,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:57,072 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:57,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 14:25:57,273 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2002780513, now seen corresponding path program 1 times [2019-12-07 14:25:57,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:25:57,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210949022] [2019-12-07 14:25:57,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 14:25:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:57,595 INFO L264 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:25:57,597 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:57,614 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:25:57,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:25:57,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,623 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:25:57,638 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:25:57,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:25:57,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:25:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:57,666 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:25:57,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210949022] [2019-12-07 14:25:57,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:57,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:25:57,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197631563] [2019-12-07 14:25:57,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:57,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:25:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:57,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:57,695 INFO L87 Difference]: Start difference. First operand 1174 states and 1656 transitions. Second operand 6 states. [2019-12-07 14:26:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:04,463 INFO L93 Difference]: Finished difference Result 2775 states and 3909 transitions. [2019-12-07 14:26:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:26:04,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-12-07 14:26:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:04,470 INFO L225 Difference]: With dead ends: 2775 [2019-12-07 14:26:04,470 INFO L226 Difference]: Without dead ends: 1611 [2019-12-07 14:26:04,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:26:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2019-12-07 14:26:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1174. [2019-12-07 14:26:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-07 14:26:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1640 transitions. [2019-12-07 14:26:04,502 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1640 transitions. Word has length 134 [2019-12-07 14:26:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:04,502 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1640 transitions. [2019-12-07 14:26:04,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:26:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1640 transitions. [2019-12-07 14:26:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 14:26:04,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:04,504 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:04,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 14:26:04,705 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-12-07 14:26:04,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:26:04,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955679182] [2019-12-07 14:26:04,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:26:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:26:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:26:05,758 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 14:26:05,758 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:26:05,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:26:06,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:26:06 BoogieIcfgContainer [2019-12-07 14:26:06,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:26:06,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:26:06,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:26:06,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:26:06,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:37" (3/4) ... [2019-12-07 14:26:06,059 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:26:06,127 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_acb67348-16f8-46c6-bf87-c7cba8984783/bin/uautomizer/witness.graphml [2019-12-07 14:26:06,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:26:06,128 INFO L168 Benchmark]: Toolchain (without parser) took 151319.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.6 MB). Free memory was 945.7 MB in the beginning and 938.0 MB in the end (delta: 7.7 MB). Peak memory consumption was 248.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:06,128 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:26:06,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:06,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:06,129 INFO L168 Benchmark]: Boogie Preprocessor took 50.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:06,129 INFO L168 Benchmark]: RCFGBuilder took 1995.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.8 MB). Peak memory consumption was 96.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:06,129 INFO L168 Benchmark]: TraceAbstraction took 148737.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.0 GB in the beginning and 954.0 MB in the end (delta: 62.6 MB). Peak memory consumption was 150.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:06,130 INFO L168 Benchmark]: Witness Printer took 70.31 ms. Allocated memory is still 1.3 GB. Free memory was 954.0 MB in the beginning and 938.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:06,131 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1995.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.8 MB). Peak memory consumption was 96.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 148737.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.0 GB in the beginning and 954.0 MB in the end (delta: 62.6 MB). Peak memory consumption was 150.1 MB. Max. memory is 11.5 GB. * Witness Printer took 70.31 ms. Allocated memory is still 1.3 GB. Free memory was 954.0 MB in the beginning and 938.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1644]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={15:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] EXPR s->info_callback VAL [init=1, SSLv3_client_data={15:0}] [L1109] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1110] EXPR s->info_callback [L1110] cb = s->info_callback [L1118] EXPR s->in_handshake [L1118] s->in_handshake += 1 [L1119] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={15:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1132] COND TRUE s->state == 12292 [L1235] s->new_session = 1 [L1236] s->state = 4096 [L1237] EXPR s->ctx [L1237] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1237] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1242] s->server = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1243] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={15:0}] [L1248] EXPR s->version VAL [init=1, SSLv3_client_data={15:0}] [L1248] COND FALSE !((s->version & 65280) != 768) [L1254] s->type = 4096 [L1255] EXPR s->init_buf VAL [init=1, SSLv3_client_data={15:0}] [L1255] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1267] tmp___4 = __VERIFIER_nondet_int() [L1268] COND FALSE !(! tmp___4) [L1274] tmp___5 = __VERIFIER_nondet_int() [L1275] COND FALSE !(! tmp___5) [L1281] s->state = 4368 [L1282] EXPR s->ctx [L1282] EXPR (s->ctx)->stats.sess_connect [L1282] (s->ctx)->stats.sess_connect += 1 [L1283] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1147] COND TRUE s->state == 4368 [L1287] s->shutdown = 0 [L1288] ret = __VERIFIER_nondet_int() [L1289] COND TRUE blastFlag == 0 [L1290] blastFlag = 1 VAL [init=1, SSLv3_client_data={15:0}] [L1294] COND FALSE !(ret <= 0) [L1299] s->state = 4384 [L1300] s->init_num = 0 [L1301] EXPR s->bbio [L1301] EXPR s->wbio VAL [init=1, SSLv3_client_data={15:0}] [L1301] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1153] COND TRUE s->state == 4384 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND TRUE blastFlag == 1 [L1311] blastFlag = 2 VAL [init=1, SSLv3_client_data={15:0}] [L1315] COND FALSE !(ret <= 0) [L1320] s->hit VAL [init=1, SSLv3_client_data={15:0}] [L1320] COND FALSE !(s->hit) [L1323] s->state = 4400 VAL [init=1, SSLv3_client_data={15:0}] [L1325] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1159] COND TRUE s->state == 4400 [L1329] EXPR s->s3 [L1329] EXPR (s->s3)->tmp.new_cipher [L1329] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={15:0}] [L1329] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1332] ret = __VERIFIER_nondet_int() [L1333] COND TRUE blastFlag == 2 [L1334] blastFlag = 3 VAL [init=1, SSLv3_client_data={15:0}] [L1338] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={15:0}] [L1344] s->state = 4416 [L1345] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1165] COND TRUE s->state == 4416 [L1349] ret = __VERIFIER_nondet_int() [L1350] COND TRUE blastFlag == 3 [L1351] blastFlag = 4 VAL [init=1, SSLv3_client_data={15:0}] [L1355] COND FALSE !(ret <= 0) [L1360] s->state = 4432 [L1361] s->init_num = 0 [L1362] tmp___6 = __VERIFIER_nondet_int() [L1363] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={15:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1171] COND TRUE s->state == 4432 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={15:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->state = 4448 [L1384] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1171] COND FALSE !(s->state == 4432) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1174] COND FALSE !(s->state == 4433) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1177] COND TRUE s->state == 4448 [L1388] ret = __VERIFIER_nondet_int() [L1389] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={15:0}] [L1644] __VERIFIER_error() VAL [init=1, SSLv3_client_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 148.6s, OverallIterations: 17, TraceHistogramMax: 7, AutomataDifference: 94.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2847 SDtfs, 2956 SDslu, 5909 SDs, 0 SdLazy, 5246 SolverSat, 600 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 90.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3578 GetRequests, 3495 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 6433 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 44.6s InterpolantComputationTime, 1930 NumberOfCodeBlocks, 1930 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3554 ConstructedInterpolants, 0 QuantifiedInterpolants, 948072 SizeOfPredicates, 76 NumberOfNonLiveVariables, 4646 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 5078/5078 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...