./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/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 425afc8b22e60c0a2f2550983f32b043f3f437d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/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 425afc8b22e60c0a2f2550983f32b043f3f437d4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 08:54:48,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:48,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:48,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:48,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:48,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:48,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:48,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:48,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:48,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:48,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:48,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:48,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:48,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:48,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:48,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:48,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:48,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:48,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:48,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:48,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:48,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:48,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:48,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:48,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:48,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:48,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:48,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:48,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:48,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:48,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:48,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:48,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:48,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:48,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:48,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:48,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:48,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:48,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:48,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:48,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:48,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:54:48,771 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:48,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:48,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:48,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:48,773 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:48,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:48,774 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:48,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:48,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:48,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:48,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:48,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:48,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:48,775 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:48,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:48,775 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:48,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:48,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:48,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:48,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:48,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:48,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:48,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:48,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:48,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:48,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:48,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:48,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:48,779 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/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-10-22 08:54:48,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:48,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:48,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:48,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:48,832 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:48,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 08:54:48,888 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/7b0d25cf2/48fba4c388fa416d9c9d4cb0cde096f5/FLAGfd9134ea8 [2019-10-22 08:54:49,348 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:49,355 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 08:54:49,364 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/7b0d25cf2/48fba4c388fa416d9c9d4cb0cde096f5/FLAGfd9134ea8 [2019-10-22 08:54:49,672 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/7b0d25cf2/48fba4c388fa416d9c9d4cb0cde096f5 [2019-10-22 08:54:49,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:49,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:49,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:49,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:49,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:49,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69015787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49, skipping insertion in model container [2019-10-22 08:54:49,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,692 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:49,733 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:50,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:50,037 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:50,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:50,114 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:50,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50 WrapperNode [2019-10-22 08:54:50,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:50,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:50,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:50,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:50,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:50,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:50,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:50,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:50,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:50,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:50,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:50,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:50,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/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-10-22 08:54:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:50,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:50,374 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:54:50,966 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 08:54:50,966 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 08:54:50,968 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:50,968 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:54:50,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50 BoogieIcfgContainer [2019-10-22 08:54:50,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:50,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:50,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:50,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:50,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:49" (1/3) ... [2019-10-22 08:54:50,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72712f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (2/3) ... [2019-10-22 08:54:50,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72712f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/3) ... [2019-10-22 08:54:50,978 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-10-22 08:54:50,990 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:50,997 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:54:51,005 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:54:51,028 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:51,029 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:51,029 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:51,029 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:51,029 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:51,029 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:51,029 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:51,029 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-10-22 08:54:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:54:51,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,057 INFO L380 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] [2019-10-22 08:54:51,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-10-22 08:54:51,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895445203] [2019-10-22 08:54:51,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895445203] [2019-10-22 08:54:51,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:51,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042536165] [2019-10-22 08:54:51,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:51,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,279 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-10-22 08:54:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,494 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-10-22 08:54:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:51,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:54:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,506 INFO L225 Difference]: With dead ends: 245 [2019-10-22 08:54:51,506 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 08:54:51,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-22 08:54:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 08:54:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 08:54:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 08:54:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-10-22 08:54:51,557 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-10-22 08:54:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,564 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-10-22 08:54:51,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-10-22 08:54:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:54:51,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,566 INFO L380 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] [2019-10-22 08:54:51,566 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,567 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-10-22 08:54:51,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584865293] [2019-10-22 08:54:51,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584865293] [2019-10-22 08:54:51,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:51,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320493628] [2019-10-22 08:54:51,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:51,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,653 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-10-22 08:54:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,863 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-10-22 08:54:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:51,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 08:54:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,865 INFO L225 Difference]: With dead ends: 232 [2019-10-22 08:54:51,866 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 08:54:51,867 INFO L600 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-10-22 08:54:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 08:54:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-22 08:54:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 08:54:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-10-22 08:54:51,884 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-10-22 08:54:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,885 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-10-22 08:54:51,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-10-22 08:54:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 08:54:51,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,886 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-10-22 08:54:51,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069726823] [2019-10-22 08:54:51,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:51,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069726823] [2019-10-22 08:54:51,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:51,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047269772] [2019-10-22 08:54:51,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:51,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,982 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-10-22 08:54:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,208 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-10-22 08:54:52,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:52,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 08:54:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,210 INFO L225 Difference]: With dead ends: 264 [2019-10-22 08:54:52,210 INFO L226 Difference]: Without dead ends: 147 [2019-10-22 08:54:52,211 INFO L600 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-10-22 08:54:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-22 08:54:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-10-22 08:54:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 08:54:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-10-22 08:54:52,226 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-10-22 08:54:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,227 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-10-22 08:54:52,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-10-22 08:54:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:54:52,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,229 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:52,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-10-22 08:54:52,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593452423] [2019-10-22 08:54:52,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:52,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593452423] [2019-10-22 08:54:52,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:52,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283418782] [2019-10-22 08:54:52,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:52,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:52,322 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-10-22 08:54:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,354 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-10-22 08:54:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:52,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 08:54:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,358 INFO L225 Difference]: With dead ends: 298 [2019-10-22 08:54:52,358 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 08:54:52,359 INFO L600 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-10-22 08:54:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 08:54:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-22 08:54:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-22 08:54:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-10-22 08:54:52,381 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-10-22 08:54:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,381 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-10-22 08:54:52,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-10-22 08:54:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:54:52,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,384 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:52,387 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-10-22 08:54:52,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953280244] [2019-10-22 08:54:52,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:54:52,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953280244] [2019-10-22 08:54:52,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:52,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660427273] [2019-10-22 08:54:52,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:52,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:52,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:52,465 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-10-22 08:54:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,710 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-10-22 08:54:52,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:52,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 08:54:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,712 INFO L225 Difference]: With dead ends: 369 [2019-10-22 08:54:52,713 INFO L226 Difference]: Without dead ends: 213 [2019-10-22 08:54:52,714 INFO L600 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-10-22 08:54:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-22 08:54:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-10-22 08:54:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-22 08:54:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-10-22 08:54:52,745 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-10-22 08:54:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,746 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-10-22 08:54:52,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-10-22 08:54:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:54:52,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,754 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:52,754 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-10-22 08:54:52,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903511956] [2019-10-22 08:54:52,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:54:52,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903511956] [2019-10-22 08:54:52,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:52,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578616451] [2019-10-22 08:54:52,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:52,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:52,845 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-10-22 08:54:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,005 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-10-22 08:54:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 08:54:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,007 INFO L225 Difference]: With dead ends: 424 [2019-10-22 08:54:53,007 INFO L226 Difference]: Without dead ends: 228 [2019-10-22 08:54:53,008 INFO L600 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-10-22 08:54:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-22 08:54:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-10-22 08:54:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-22 08:54:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-10-22 08:54:53,018 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-10-22 08:54:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,018 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-10-22 08:54:53,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-10-22 08:54:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:54:53,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,021 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:53,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-10-22 08:54:53,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078418445] [2019-10-22 08:54:53,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 08:54:53,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078418445] [2019-10-22 08:54:53,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772531344] [2019-10-22 08:54:53,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:53,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:53,069 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-10-22 08:54:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,220 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-10-22 08:54:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-22 08:54:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,222 INFO L225 Difference]: With dead ends: 463 [2019-10-22 08:54:53,222 INFO L226 Difference]: Without dead ends: 248 [2019-10-22 08:54:53,223 INFO L600 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-10-22 08:54:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-22 08:54:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-10-22 08:54:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-22 08:54:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-10-22 08:54:53,232 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-10-22 08:54:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,232 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-10-22 08:54:53,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-10-22 08:54:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 08:54:53,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,234 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:53,234 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,235 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-10-22 08:54:53,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069781168] [2019-10-22 08:54:53,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 08:54:53,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069781168] [2019-10-22 08:54:53,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83564905] [2019-10-22 08:54:53,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:53,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:53,313 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-10-22 08:54:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,367 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-10-22 08:54:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-22 08:54:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,371 INFO L225 Difference]: With dead ends: 694 [2019-10-22 08:54:53,371 INFO L226 Difference]: Without dead ends: 458 [2019-10-22 08:54:53,371 INFO L600 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-10-22 08:54:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-22 08:54:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-10-22 08:54:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-22 08:54:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-10-22 08:54:53,397 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-10-22 08:54:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,397 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-10-22 08:54:53,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-10-22 08:54:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 08:54:53,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,399 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:53,399 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-10-22 08:54:53,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884527136] [2019-10-22 08:54:53,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 08:54:53,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884527136] [2019-10-22 08:54:53,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177526335] [2019-10-22 08:54:53,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:53,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:53,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:53,487 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-10-22 08:54:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,534 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-10-22 08:54:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 08:54:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,537 INFO L225 Difference]: With dead ends: 673 [2019-10-22 08:54:53,537 INFO L226 Difference]: Without dead ends: 671 [2019-10-22 08:54:53,538 INFO L600 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-10-22 08:54:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-22 08:54:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-10-22 08:54:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-10-22 08:54:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-10-22 08:54:53,558 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-10-22 08:54:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,558 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-10-22 08:54:53,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-10-22 08:54:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-22 08:54:53,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,565 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:53,565 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-10-22 08:54:53,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217315964] [2019-10-22 08:54:53,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 08:54:53,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217315964] [2019-10-22 08:54:53,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712662396] [2019-10-22 08:54:53,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:53,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:53,635 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-10-22 08:54:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,810 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-10-22 08:54:53,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-22 08:54:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,816 INFO L225 Difference]: With dead ends: 1483 [2019-10-22 08:54:53,816 INFO L226 Difference]: Without dead ends: 818 [2019-10-22 08:54:53,817 INFO L600 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-10-22 08:54:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-22 08:54:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-10-22 08:54:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-22 08:54:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-10-22 08:54:53,839 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-10-22 08:54:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,840 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-10-22 08:54:53,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-10-22 08:54:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-22 08:54:53,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,843 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:53,843 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-10-22 08:54:53,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651639568] [2019-10-22 08:54:53,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-22 08:54:53,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651639568] [2019-10-22 08:54:53,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140938014] [2019-10-22 08:54:53,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:53,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:53,909 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-10-22 08:54:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,082 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-10-22 08:54:54,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:54,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-22 08:54:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:54,086 INFO L225 Difference]: With dead ends: 1845 [2019-10-22 08:54:54,088 INFO L226 Difference]: Without dead ends: 1015 [2019-10-22 08:54:54,089 INFO L600 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-10-22 08:54:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-10-22 08:54:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-10-22 08:54:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-10-22 08:54:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-10-22 08:54:54,114 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-10-22 08:54:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:54,114 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-10-22 08:54:54,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-10-22 08:54:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-22 08:54:54,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:54,117 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,118 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-10-22 08:54:54,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241363053] [2019-10-22 08:54:54,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-22 08:54:54,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241363053] [2019-10-22 08:54:54,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:54,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045309342] [2019-10-22 08:54:54,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:54,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:54,257 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-10-22 08:54:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,294 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-10-22 08:54:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:54,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-22 08:54:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:54,299 INFO L225 Difference]: With dead ends: 2279 [2019-10-22 08:54:54,300 INFO L226 Difference]: Without dead ends: 1311 [2019-10-22 08:54:54,301 INFO L600 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-10-22 08:54:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-10-22 08:54:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-10-22 08:54:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-10-22 08:54:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-10-22 08:54:54,338 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-10-22 08:54:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:54,338 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-10-22 08:54:54,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-10-22 08:54:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 08:54:54,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:54,343 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,343 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-10-22 08:54:54,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438719487] [2019-10-22 08:54:54,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 08:54:54,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438719487] [2019-10-22 08:54:54,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:54,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54402619] [2019-10-22 08:54:54,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:54,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:54,451 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-10-22 08:54:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,503 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-10-22 08:54:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:54,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-22 08:54:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:54,545 INFO L225 Difference]: With dead ends: 3667 [2019-10-22 08:54:54,546 INFO L226 Difference]: Without dead ends: 2365 [2019-10-22 08:54:54,547 INFO L600 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-10-22 08:54:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-10-22 08:54:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-10-22 08:54:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-10-22 08:54:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-10-22 08:54:54,607 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-10-22 08:54:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:54,608 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-10-22 08:54:54,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-10-22 08:54:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 08:54:54,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:54,612 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,612 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:54,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-10-22 08:54:54,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460708892] [2019-10-22 08:54:54,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,795 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:54,795 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:54:54,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:54 BoogieIcfgContainer [2019-10-22 08:54:54,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:54,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:54,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:54,895 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:54,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/4) ... [2019-10-22 08:54:54,899 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:54,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:54,901 INFO L168 Benchmark]: Toolchain (without parser) took 5225.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -329.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,903 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:54,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.33 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,906 INFO L168 Benchmark]: Boogie Preprocessor took 32.72 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,907 INFO L168 Benchmark]: RCFGBuilder took 767.79 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,907 INFO L168 Benchmark]: TraceAbstraction took 3923.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -191.0 MB). Peak memory consumption was 921.0 kB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,907 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:54,913 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.33 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.72 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 767.79 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3923.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -191.0 MB). Peak memory consumption was 921.0 kB. Max. memory is 11.5 GB. * Witness Printer took 4.62 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 607]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 355. Possible FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.8s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, 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, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 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.24-cad4683 [2019-10-22 08:54:57,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:57,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:57,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:57,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:57,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:57,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:57,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:57,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:57,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:57,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:57,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:57,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:57,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:57,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:57,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:57,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:57,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:57,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:57,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:57,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:57,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:57,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:57,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:57,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:57,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:57,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:57,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:57,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:57,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:57,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:57,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:57,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:57,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:57,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:57,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:57,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:57,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:57,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:57,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:57,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:57,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 08:54:57,126 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:57,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:57,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:57,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:57,128 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:57,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:57,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:57,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:57,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:57,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:57,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:57,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:57,129 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 08:54:57,129 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 08:54:57,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:57,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:57,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:57,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:57,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:57,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:57,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:57,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:57,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:57,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:57,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:57,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:57,132 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 08:54:57,132 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 08:54:57,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:57,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 08:54:57,133 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/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-10-22 08:54:57,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:57,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:57,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:57,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:57,190 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:57,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 08:54:57,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/0f710372b/b3bb84834257405eb86fa358aa108e83/FLAG154894613 [2019-10-22 08:54:57,662 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:57,664 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 08:54:57,679 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/0f710372b/b3bb84834257405eb86fa358aa108e83/FLAG154894613 [2019-10-22 08:54:58,015 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/data/0f710372b/b3bb84834257405eb86fa358aa108e83 [2019-10-22 08:54:58,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:58,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:58,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:58,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:58,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:58,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a75a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58, skipping insertion in model container [2019-10-22 08:54:58,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,035 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:58,075 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:58,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:58,348 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:58,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:58,536 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:58,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58 WrapperNode [2019-10-22 08:54:58,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:58,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:58,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:58,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:58,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:58,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:58,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:58,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:58,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:58,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:58,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:58,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:58,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/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-10-22 08:54:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:58,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:58,834 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:54:59,318 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 08:54:59,319 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 08:54:59,320 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:59,321 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:54:59,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:59 BoogieIcfgContainer [2019-10-22 08:54:59,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:59,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:59,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:59,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:59,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:58" (1/3) ... [2019-10-22 08:54:59,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3297bb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:59, skipping insertion in model container [2019-10-22 08:54:59,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58" (2/3) ... [2019-10-22 08:54:59,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3297bb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:59, skipping insertion in model container [2019-10-22 08:54:59,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:59" (3/3) ... [2019-10-22 08:54:59,330 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-10-22 08:54:59,341 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:59,349 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:54:59,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:54:59,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:59,385 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:59,385 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:59,385 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:59,385 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:59,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:59,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:59,386 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-10-22 08:54:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:54:59,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:59,414 INFO L380 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] [2019-10-22 08:54:59,415 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-10-22 08:54:59,431 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:54:59,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1892795013] [2019-10-22 08:54:59,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:54:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:59,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:59,613 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:54:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:59,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1892795013] [2019-10-22 08:54:59,623 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:59,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 08:54:59,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015322467] [2019-10-22 08:54:59,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:59,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:54:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:59,652 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-10-22 08:54:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:59,877 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-10-22 08:54:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:59,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:54:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:59,891 INFO L225 Difference]: With dead ends: 245 [2019-10-22 08:54:59,891 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 08:54:59,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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-10-22 08:54:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 08:54:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 08:54:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 08:54:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-10-22 08:54:59,938 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-10-22 08:54:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:59,939 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-10-22 08:54:59,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-10-22 08:54:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:54:59,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:59,941 INFO L380 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] [2019-10-22 08:55:00,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:00,143 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-10-22 08:55:00,143 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:00,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [920371389] [2019-10-22 08:55:00,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:00,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:00,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:00,273 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:00,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [920371389] [2019-10-22 08:55:00,279 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:00,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:00,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849342186] [2019-10-22 08:55:00,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:00,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:00,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:00,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:00,282 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-10-22 08:55:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:00,455 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-10-22 08:55:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:00,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 08:55:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:00,458 INFO L225 Difference]: With dead ends: 232 [2019-10-22 08:55:00,458 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 08:55:00,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-10-22 08:55:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 08:55:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-22 08:55:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 08:55:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-10-22 08:55:00,472 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-10-22 08:55:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:00,473 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-10-22 08:55:00,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-10-22 08:55:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 08:55:00,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:00,474 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:00,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:00,676 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-10-22 08:55:00,676 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:00,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2031615686] [2019-10-22 08:55:00,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:00,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:00,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:55:00,793 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:55:00,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2031615686] [2019-10-22 08:55:00,804 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:00,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:00,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509119415] [2019-10-22 08:55:00,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:00,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:00,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:00,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:00,808 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-10-22 08:55:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:01,002 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-10-22 08:55:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:01,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 08:55:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:01,005 INFO L225 Difference]: With dead ends: 264 [2019-10-22 08:55:01,005 INFO L226 Difference]: Without dead ends: 147 [2019-10-22 08:55:01,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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-10-22 08:55:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-22 08:55:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-10-22 08:55:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 08:55:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-10-22 08:55:01,025 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-10-22 08:55:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:01,026 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-10-22 08:55:01,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-10-22 08:55:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:55:01,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:01,027 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:01,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:01,230 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-10-22 08:55:01,231 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:01,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [398113768] [2019-10-22 08:55:01,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:01,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:55:01,351 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:55:01,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [398113768] [2019-10-22 08:55:01,361 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:01,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059616701] [2019-10-22 08:55:01,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:01,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:01,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:01,363 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-10-22 08:55:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:01,390 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-10-22 08:55:01,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:01,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 08:55:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:01,392 INFO L225 Difference]: With dead ends: 298 [2019-10-22 08:55:01,393 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 08:55:01,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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-10-22 08:55:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 08:55:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-22 08:55:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-22 08:55:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-10-22 08:55:01,403 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-10-22 08:55:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:01,404 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-10-22 08:55:01,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-10-22 08:55:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:55:01,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:01,406 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:01,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:01,607 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-10-22 08:55:01,608 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:01,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [815496346] [2019-10-22 08:55:01,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:01,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:55:01,731 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:55:01,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815496346] [2019-10-22 08:55:01,743 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 08:55:01,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657267221] [2019-10-22 08:55:01,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:01,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:01,745 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-10-22 08:55:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:01,815 INFO L93 Difference]: Finished difference Result 581 states and 851 transitions. [2019-10-22 08:55:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:01,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-22 08:55:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:01,819 INFO L225 Difference]: With dead ends: 581 [2019-10-22 08:55:01,819 INFO L226 Difference]: Without dead ends: 426 [2019-10-22 08:55:01,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 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-10-22 08:55:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-22 08:55:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-10-22 08:55:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-22 08:55:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2019-10-22 08:55:01,844 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 66 [2019-10-22 08:55:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:01,844 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2019-10-22 08:55:01,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2019-10-22 08:55:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:55:01,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:01,848 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:02,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:02,049 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2019-10-22 08:55:02,050 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:02,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [171846024] [2019-10-22 08:55:02,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:02,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:02,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 08:55:02,185 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 08:55:02,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [171846024] [2019-10-22 08:55:02,205 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:02,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 08:55:02,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542170594] [2019-10-22 08:55:02,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:02,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:02,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:02,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:02,207 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand 3 states. [2019-10-22 08:55:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:02,271 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-10-22 08:55:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:02,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 08:55:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:02,277 INFO L225 Difference]: With dead ends: 869 [2019-10-22 08:55:02,277 INFO L226 Difference]: Without dead ends: 452 [2019-10-22 08:55:02,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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-10-22 08:55:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-22 08:55:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-10-22 08:55:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-22 08:55:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 653 transitions. [2019-10-22 08:55:02,313 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 653 transitions. Word has length 67 [2019-10-22 08:55:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:02,313 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 653 transitions. [2019-10-22 08:55:02,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 653 transitions. [2019-10-22 08:55:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 08:55:02,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:02,321 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-10-22 08:55:02,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:02,522 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:02,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2029292557, now seen corresponding path program 1 times [2019-10-22 08:55:02,522 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:02,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1217606719] [2019-10-22 08:55:02,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:02,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:02,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-22 08:55:02,660 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-22 08:55:02,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1217606719] [2019-10-22 08:55:02,681 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:02,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 08:55:02,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278319883] [2019-10-22 08:55:02,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:02,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:02,682 INFO L87 Difference]: Start difference. First operand 452 states and 653 transitions. Second operand 4 states. [2019-10-22 08:55:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:02,955 INFO L93 Difference]: Finished difference Result 1066 states and 1615 transitions. [2019-10-22 08:55:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:02,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-22 08:55:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:02,959 INFO L225 Difference]: With dead ends: 1066 [2019-10-22 08:55:02,959 INFO L226 Difference]: Without dead ends: 649 [2019-10-22 08:55:02,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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-10-22 08:55:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-22 08:55:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2019-10-22 08:55:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-22 08:55:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2019-10-22 08:55:02,981 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 116 [2019-10-22 08:55:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:02,981 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2019-10-22 08:55:02,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2019-10-22 08:55:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 08:55:02,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:02,983 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-10-22 08:55:03,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:03,184 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1450806153, now seen corresponding path program 1 times [2019-10-22 08:55:03,185 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:03,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [311369380] [2019-10-22 08:55:03,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:03,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:03,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-22 08:55:03,306 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-22 08:55:03,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [311369380] [2019-10-22 08:55:03,319 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:03,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:03,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943012281] [2019-10-22 08:55:03,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:03,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:03,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:03,321 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand 3 states. [2019-10-22 08:55:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:03,474 INFO L93 Difference]: Finished difference Result 1291 states and 1846 transitions. [2019-10-22 08:55:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:03,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-22 08:55:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:03,478 INFO L225 Difference]: With dead ends: 1291 [2019-10-22 08:55:03,478 INFO L226 Difference]: Without dead ends: 697 [2019-10-22 08:55:03,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 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-10-22 08:55:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-22 08:55:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 686. [2019-10-22 08:55:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-22 08:55:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 959 transitions. [2019-10-22 08:55:03,498 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 959 transitions. Word has length 116 [2019-10-22 08:55:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:03,498 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 959 transitions. [2019-10-22 08:55:03,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 959 transitions. [2019-10-22 08:55:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-22 08:55:03,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:03,501 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 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] [2019-10-22 08:55:03,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:03,702 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:03,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782797, now seen corresponding path program 1 times [2019-10-22 08:55:03,703 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:03,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [888588127] [2019-10-22 08:55:03,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:03,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:03,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-22 08:55:03,836 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-22 08:55:03,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [888588127] [2019-10-22 08:55:03,856 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:03,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:03,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114031997] [2019-10-22 08:55:03,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:03,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:03,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:03,858 INFO L87 Difference]: Start difference. First operand 686 states and 959 transitions. Second operand 3 states. [2019-10-22 08:55:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:03,894 INFO L93 Difference]: Finished difference Result 1565 states and 2188 transitions. [2019-10-22 08:55:03,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:03,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-22 08:55:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:03,898 INFO L225 Difference]: With dead ends: 1565 [2019-10-22 08:55:03,898 INFO L226 Difference]: Without dead ends: 914 [2019-10-22 08:55:03,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 261 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-10-22 08:55:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-22 08:55:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-10-22 08:55:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-10-22 08:55:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1272 transitions. [2019-10-22 08:55:03,925 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1272 transitions. Word has length 132 [2019-10-22 08:55:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:03,925 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1272 transitions. [2019-10-22 08:55:03,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1272 transitions. [2019-10-22 08:55:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-22 08:55:03,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:03,928 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:04,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:04,129 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1283173259, now seen corresponding path program 1 times [2019-10-22 08:55:04,130 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:04,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [642259934] [2019-10-22 08:55:04,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:04,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-22 08:55:04,258 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-22 08:55:04,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642259934] [2019-10-22 08:55:04,282 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:04,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:04,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106805911] [2019-10-22 08:55:04,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:04,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:04,284 INFO L87 Difference]: Start difference. First operand 914 states and 1272 transitions. Second operand 3 states. [2019-10-22 08:55:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:04,475 INFO L93 Difference]: Finished difference Result 1847 states and 2596 transitions. [2019-10-22 08:55:04,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:04,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-22 08:55:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:04,480 INFO L225 Difference]: With dead ends: 1847 [2019-10-22 08:55:04,481 INFO L226 Difference]: Without dead ends: 989 [2019-10-22 08:55:04,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 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-10-22 08:55:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-10-22 08:55:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2019-10-22 08:55:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-10-22 08:55:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1350 transitions. [2019-10-22 08:55:04,540 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1350 transitions. Word has length 134 [2019-10-22 08:55:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:04,540 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1350 transitions. [2019-10-22 08:55:04,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1350 transitions. [2019-10-22 08:55:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 08:55:04,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:04,545 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:04,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:04,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2019-10-22 08:55:04,747 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:04,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1962166161] [2019-10-22 08:55:04,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:04,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-22 08:55:04,898 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-22 08:55:04,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1962166161] [2019-10-22 08:55:04,924 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:04,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:04,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364145976] [2019-10-22 08:55:04,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:04,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:04,926 INFO L87 Difference]: Start difference. First operand 977 states and 1350 transitions. Second operand 3 states. [2019-10-22 08:55:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:04,980 INFO L93 Difference]: Finished difference Result 2432 states and 3404 transitions. [2019-10-22 08:55:04,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:04,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 08:55:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:04,987 INFO L225 Difference]: With dead ends: 2432 [2019-10-22 08:55:04,988 INFO L226 Difference]: Without dead ends: 1511 [2019-10-22 08:55:04,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 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-10-22 08:55:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-10-22 08:55:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2019-10-22 08:55:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-10-22 08:55:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2114 transitions. [2019-10-22 08:55:05,036 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2114 transitions. Word has length 174 [2019-10-22 08:55:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:05,036 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 2114 transitions. [2019-10-22 08:55:05,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2114 transitions. [2019-10-22 08:55:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 08:55:05,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:05,040 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:05,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:05,241 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:05,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2019-10-22 08:55:05,242 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:05,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [10692978] [2019-10-22 08:55:05,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-22 08:55:05,404 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-22 08:55:05,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [10692978] [2019-10-22 08:55:05,432 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:05,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:05,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271873219] [2019-10-22 08:55:05,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:05,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:05,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:05,433 INFO L87 Difference]: Start difference. First operand 1509 states and 2114 transitions. Second operand 3 states. [2019-10-22 08:55:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:05,485 INFO L93 Difference]: Finished difference Result 2354 states and 3283 transitions. [2019-10-22 08:55:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:05,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 08:55:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:05,491 INFO L225 Difference]: With dead ends: 2354 [2019-10-22 08:55:05,491 INFO L226 Difference]: Without dead ends: 1513 [2019-10-22 08:55:05,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 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-10-22 08:55:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-10-22 08:55:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2019-10-22 08:55:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-10-22 08:55:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2107 transitions. [2019-10-22 08:55:05,547 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2107 transitions. Word has length 174 [2019-10-22 08:55:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:05,547 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 2107 transitions. [2019-10-22 08:55:05,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2107 transitions. [2019-10-22 08:55:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 08:55:05,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:05,551 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-22 08:55:05,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:05,752 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2019-10-22 08:55:05,752 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:05,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1809968782] [2019-10-22 08:55:05,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:05,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 08:55:05,897 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 08:55:05,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1809968782] [2019-10-22 08:55:05,920 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:05,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 08:55:05,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793017644] [2019-10-22 08:55:05,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:05,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:05,922 INFO L87 Difference]: Start difference. First operand 1511 states and 2107 transitions. Second operand 4 states. [2019-10-22 08:55:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:06,198 INFO L93 Difference]: Finished difference Result 3056 states and 4299 transitions. [2019-10-22 08:55:06,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-10-22 08:55:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:06,204 INFO L225 Difference]: With dead ends: 3056 [2019-10-22 08:55:06,205 INFO L226 Difference]: Without dead ends: 1603 [2019-10-22 08:55:06,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 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-10-22 08:55:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-10-22 08:55:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1557. [2019-10-22 08:55:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-10-22 08:55:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2119 transitions. [2019-10-22 08:55:06,273 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2119 transitions. Word has length 174 [2019-10-22 08:55:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:06,274 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2119 transitions. [2019-10-22 08:55:06,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2119 transitions. [2019-10-22 08:55:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 08:55:06,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:06,280 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:06,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:06,481 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-10-22 08:55:06,482 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:06,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1382472771] [2019-10-22 08:55:06,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,251 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-10-22 08:55:07,251 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:55:07,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:55:07,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:07 BoogieIcfgContainer [2019-10-22 08:55:07,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:07,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:07,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:07,556 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:07,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:59" (3/4) ... [2019-10-22 08:55:07,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:55:07,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d0e2f30-fc04-47d8-b0a0-c13ff9c767b8/bin/uautomizer/witness.graphml [2019-10-22 08:55:07,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:07,720 INFO L168 Benchmark]: Toolchain (without parser) took 9700.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -305.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:07,720 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:07,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:07,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:07,721 INFO L168 Benchmark]: Boogie Preprocessor took 47.26 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-10-22 08:55:07,721 INFO L168 Benchmark]: RCFGBuilder took 685.91 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:07,721 INFO L168 Benchmark]: TraceAbstraction took 8231.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:07,722 INFO L168 Benchmark]: Witness Printer took 162.35 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:07,723 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 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 517.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.26 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 685.91 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8231.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 162.35 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.1s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2513 SDtfs, 1104 SDslu, 1676 SDs, 0 SdLazy, 922 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2626 GetRequests, 2610 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=13, 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, 13 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2626 ConstructedInterpolants, 0 QuantifiedInterpolants, 558953 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 4520/4520 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...