./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/s3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/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 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/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 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:27:17,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:27:17,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:27:17,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:27:17,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:27:17,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:27:17,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:27:17,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:27:17,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:27:17,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:27:17,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:27:17,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:27:17,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:27:17,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:27:17,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:27:17,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:27:17,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:27:17,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:27:17,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:27:17,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:27:17,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:27:17,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:27:17,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:27:17,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:27:17,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:27:17,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:27:17,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:27:17,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:27:17,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:27:17,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:27:17,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:27:17,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:27:17,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:27:17,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:27:17,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:27:17,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:27:17,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:27:17,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:27:17,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:27:17,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:27:17,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:27:17,363 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:27:17,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:27:17,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:27:17,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:27:17,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:27:17,377 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:27:17,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:27:17,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:27:17,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:27:17,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:27:17,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:27:17,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:27:17,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:27:17,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:27:17,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:27:17,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:27:17,379 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:27:17,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:27:17,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:27:17,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:27:17,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:27:17,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:27:17,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:27:17,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:27:17,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:27:17,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:27:17,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:27:17,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:27:17,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:27:17,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:27:17,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/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 -> 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f [2019-12-07 10:27:17,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:27:17,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:27:17,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:27:17,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:27:17,499 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:27:17,500 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/../../sv-benchmarks/c/loops/s3.i [2019-12-07 10:27:17,541 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/0c33b193a/a0658e21388c421aa2de9c0b619f4e98/FLAG75c1bccb5 [2019-12-07 10:27:18,016 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:27:18,016 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/sv-benchmarks/c/loops/s3.i [2019-12-07 10:27:18,027 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/0c33b193a/a0658e21388c421aa2de9c0b619f4e98/FLAG75c1bccb5 [2019-12-07 10:27:18,036 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/0c33b193a/a0658e21388c421aa2de9c0b619f4e98 [2019-12-07 10:27:18,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:27:18,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:27:18,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:27:18,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:27:18,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:27:18,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581b80cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18, skipping insertion in model container [2019-12-07 10:27:18,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:27:18,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:27:18,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:27:18,360 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:27:18,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:27:18,435 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:27:18,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18 WrapperNode [2019-12-07 10:27:18,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:27:18,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:27:18,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:27:18,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:27:18,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:27:18,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:27:18,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:27:18,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:27:18,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... [2019-12-07 10:27:18,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:27:18,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:27:18,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:27:18,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:27:18,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:27:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:27:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:27:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:27:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:27:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:27:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:27:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:27:18,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:27:18,759 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 10:27:19,232 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 10:27:19,232 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 10:27:19,233 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:27:19,234 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:27:19,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:19 BoogieIcfgContainer [2019-12-07 10:27:19,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:27:19,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:27:19,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:27:19,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:27:19,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:27:18" (1/3) ... [2019-12-07 10:27:19,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa5711e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:27:19, skipping insertion in model container [2019-12-07 10:27:19,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:18" (2/3) ... [2019-12-07 10:27:19,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa5711e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:27:19, skipping insertion in model container [2019-12-07 10:27:19,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:19" (3/3) ... [2019-12-07 10:27:19,241 INFO L109 eAbstractionObserver]: Analyzing ICFG s3.i [2019-12-07 10:27:19,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:27:19,255 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:27:19,263 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:27:19,279 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:27:19,279 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:27:19,280 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:27:19,280 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:27:19,280 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:27:19,280 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:27:19,280 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:27:19,280 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:27:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-12-07 10:27:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:27:19,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:19,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:19,298 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-12-07 10:27:19,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:19,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873514120] [2019-12-07 10:27:19,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:19,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873514120] [2019-12-07 10:27:19,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:19,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:19,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164868718] [2019-12-07 10:27:19,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:19,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:19,508 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-12-07 10:27:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:19,579 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-12-07 10:27:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:19,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 10:27:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:19,592 INFO L225 Difference]: With dead ends: 375 [2019-12-07 10:27:19,592 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 10:27:19,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 10:27:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-12-07 10:27:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 10:27:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2019-12-07 10:27:19,641 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2019-12-07 10:27:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:19,641 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2019-12-07 10:27:19,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2019-12-07 10:27:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:27:19,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:19,643 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:19,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2019-12-07 10:27:19,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:19,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702612322] [2019-12-07 10:27:19,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:19,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702612322] [2019-12-07 10:27:19,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:19,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:19,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018404270] [2019-12-07 10:27:19,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:19,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:19,720 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 4 states. [2019-12-07 10:27:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:19,991 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2019-12-07 10:27:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:19,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 10:27:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:19,994 INFO L225 Difference]: With dead ends: 359 [2019-12-07 10:27:19,994 INFO L226 Difference]: Without dead ends: 252 [2019-12-07 10:27:19,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-12-07 10:27:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2019-12-07 10:27:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:27:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 351 transitions. [2019-12-07 10:27:20,007 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 351 transitions. Word has length 39 [2019-12-07 10:27:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:20,007 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 351 transitions. [2019-12-07 10:27:20,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 351 transitions. [2019-12-07 10:27:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 10:27:20,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:20,010 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:20,010 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1468155038, now seen corresponding path program 1 times [2019-12-07 10:27:20,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:20,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465592515] [2019-12-07 10:27:20,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:20,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465592515] [2019-12-07 10:27:20,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:20,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:20,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286205605] [2019-12-07 10:27:20,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:20,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:20,071 INFO L87 Difference]: Start difference. First operand 235 states and 351 transitions. Second operand 4 states. [2019-12-07 10:27:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:20,316 INFO L93 Difference]: Finished difference Result 376 states and 562 transitions. [2019-12-07 10:27:20,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:20,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 10:27:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:20,318 INFO L225 Difference]: With dead ends: 376 [2019-12-07 10:27:20,318 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 10:27:20,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 10:27:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-12-07 10:27:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:27:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2019-12-07 10:27:20,329 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 54 [2019-12-07 10:27:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:20,330 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2019-12-07 10:27:20,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2019-12-07 10:27:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 10:27:20,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:20,332 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:20,332 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1486810496, now seen corresponding path program 1 times [2019-12-07 10:27:20,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:20,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286712491] [2019-12-07 10:27:20,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:20,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286712491] [2019-12-07 10:27:20,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:20,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:20,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655254600] [2019-12-07 10:27:20,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:20,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:20,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:20,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:20,397 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand 4 states. [2019-12-07 10:27:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:20,639 INFO L93 Difference]: Finished difference Result 376 states and 560 transitions. [2019-12-07 10:27:20,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:20,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 10:27:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:20,641 INFO L225 Difference]: With dead ends: 376 [2019-12-07 10:27:20,641 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 10:27:20,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 10:27:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-12-07 10:27:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:27:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 349 transitions. [2019-12-07 10:27:20,652 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 349 transitions. Word has length 54 [2019-12-07 10:27:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:20,652 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 349 transitions. [2019-12-07 10:27:20,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 349 transitions. [2019-12-07 10:27:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:27:20,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:20,654 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:20,655 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1014296481, now seen corresponding path program 1 times [2019-12-07 10:27:20,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:20,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047291339] [2019-12-07 10:27:20,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:20,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047291339] [2019-12-07 10:27:20,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:20,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:20,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497303550] [2019-12-07 10:27:20,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:20,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:20,710 INFO L87 Difference]: Start difference. First operand 235 states and 349 transitions. Second operand 4 states. [2019-12-07 10:27:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:20,958 INFO L93 Difference]: Finished difference Result 376 states and 558 transitions. [2019-12-07 10:27:20,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:20,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 10:27:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:20,960 INFO L225 Difference]: With dead ends: 376 [2019-12-07 10:27:20,961 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 10:27:20,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 10:27:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-12-07 10:27:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:27:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 348 transitions. [2019-12-07 10:27:20,968 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 348 transitions. Word has length 55 [2019-12-07 10:27:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:20,968 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 348 transitions. [2019-12-07 10:27:20,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 348 transitions. [2019-12-07 10:27:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:27:20,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:20,969 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:20,969 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1792231515, now seen corresponding path program 1 times [2019-12-07 10:27:20,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:20,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773200730] [2019-12-07 10:27:20,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:21,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773200730] [2019-12-07 10:27:21,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:21,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:21,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655201634] [2019-12-07 10:27:21,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:21,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:21,015 INFO L87 Difference]: Start difference. First operand 235 states and 348 transitions. Second operand 4 states. [2019-12-07 10:27:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:21,266 INFO L93 Difference]: Finished difference Result 376 states and 556 transitions. [2019-12-07 10:27:21,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:21,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 10:27:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:21,268 INFO L225 Difference]: With dead ends: 376 [2019-12-07 10:27:21,268 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 10:27:21,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 10:27:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-12-07 10:27:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:27:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 347 transitions. [2019-12-07 10:27:21,274 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 347 transitions. Word has length 56 [2019-12-07 10:27:21,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:21,275 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 347 transitions. [2019-12-07 10:27:21,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 347 transitions. [2019-12-07 10:27:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 10:27:21,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:21,276 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:21,276 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:21,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1615585892, now seen corresponding path program 1 times [2019-12-07 10:27:21,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:21,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087713616] [2019-12-07 10:27:21,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:21,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087713616] [2019-12-07 10:27:21,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:21,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:21,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629743461] [2019-12-07 10:27:21,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:21,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:21,320 INFO L87 Difference]: Start difference. First operand 235 states and 347 transitions. Second operand 4 states. [2019-12-07 10:27:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:21,524 INFO L93 Difference]: Finished difference Result 367 states and 543 transitions. [2019-12-07 10:27:21,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:21,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 10:27:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:21,527 INFO L225 Difference]: With dead ends: 367 [2019-12-07 10:27:21,527 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 10:27:21,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 10:27:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 235. [2019-12-07 10:27:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:27:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 346 transitions. [2019-12-07 10:27:21,534 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 346 transitions. Word has length 57 [2019-12-07 10:27:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:21,535 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 346 transitions. [2019-12-07 10:27:21,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 346 transitions. [2019-12-07 10:27:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 10:27:21,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:21,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:21,536 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2019-12-07 10:27:21,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:21,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434841688] [2019-12-07 10:27:21,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:27:21,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434841688] [2019-12-07 10:27:21,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:21,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:21,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207496144] [2019-12-07 10:27:21,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:21,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:21,571 INFO L87 Difference]: Start difference. First operand 235 states and 346 transitions. Second operand 3 states. [2019-12-07 10:27:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:21,597 INFO L93 Difference]: Finished difference Result 483 states and 715 transitions. [2019-12-07 10:27:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:21,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 10:27:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:21,600 INFO L225 Difference]: With dead ends: 483 [2019-12-07 10:27:21,600 INFO L226 Difference]: Without dead ends: 358 [2019-12-07 10:27:21,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-07 10:27:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2019-12-07 10:27:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 10:27:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 527 transitions. [2019-12-07 10:27:21,610 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 527 transitions. Word has length 57 [2019-12-07 10:27:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:21,611 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 527 transitions. [2019-12-07 10:27:21,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 527 transitions. [2019-12-07 10:27:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 10:27:21,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:21,612 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:21,612 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:21,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2019-12-07 10:27:21,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:21,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263730329] [2019-12-07 10:27:21,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:27:21,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263730329] [2019-12-07 10:27:21,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:21,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:21,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562399992] [2019-12-07 10:27:21,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:21,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:21,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:21,675 INFO L87 Difference]: Start difference. First operand 358 states and 527 transitions. Second operand 4 states. [2019-12-07 10:27:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:22,032 INFO L93 Difference]: Finished difference Result 989 states and 1463 transitions. [2019-12-07 10:27:22,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:22,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 10:27:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:22,036 INFO L225 Difference]: With dead ends: 989 [2019-12-07 10:27:22,036 INFO L226 Difference]: Without dead ends: 638 [2019-12-07 10:27:22,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-12-07 10:27:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 421. [2019-12-07 10:27:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-07 10:27:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-12-07 10:27:22,062 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 77 [2019-12-07 10:27:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:22,063 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-12-07 10:27:22,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-12-07 10:27:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 10:27:22,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:22,064 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:22,064 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash -126791679, now seen corresponding path program 1 times [2019-12-07 10:27:22,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:22,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132405818] [2019-12-07 10:27:22,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:22,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132405818] [2019-12-07 10:27:22,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:22,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:22,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334666298] [2019-12-07 10:27:22,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:22,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:22,116 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-12-07 10:27:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:22,390 INFO L93 Difference]: Finished difference Result 975 states and 1463 transitions. [2019-12-07 10:27:22,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:22,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 10:27:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:22,394 INFO L225 Difference]: With dead ends: 975 [2019-12-07 10:27:22,394 INFO L226 Difference]: Without dead ends: 561 [2019-12-07 10:27:22,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-12-07 10:27:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 487. [2019-12-07 10:27:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 746 transitions. [2019-12-07 10:27:22,409 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 746 transitions. Word has length 77 [2019-12-07 10:27:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:22,409 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 746 transitions. [2019-12-07 10:27:22,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 746 transitions. [2019-12-07 10:27:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 10:27:22,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:22,411 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:22,411 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 416305772, now seen corresponding path program 1 times [2019-12-07 10:27:22,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:22,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7412910] [2019-12-07 10:27:22,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:22,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7412910] [2019-12-07 10:27:22,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:22,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:22,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045550724] [2019-12-07 10:27:22,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:22,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:22,455 INFO L87 Difference]: Start difference. First operand 487 states and 746 transitions. Second operand 4 states. [2019-12-07 10:27:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:22,730 INFO L93 Difference]: Finished difference Result 1038 states and 1571 transitions. [2019-12-07 10:27:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:22,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 10:27:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:22,733 INFO L225 Difference]: With dead ends: 1038 [2019-12-07 10:27:22,734 INFO L226 Difference]: Without dead ends: 558 [2019-12-07 10:27:22,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-12-07 10:27:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-12-07 10:27:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 743 transitions. [2019-12-07 10:27:22,750 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 743 transitions. Word has length 92 [2019-12-07 10:27:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:22,750 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 743 transitions. [2019-12-07 10:27:22,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 743 transitions. [2019-12-07 10:27:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 10:27:22,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:22,752 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:22,752 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash 397650314, now seen corresponding path program 1 times [2019-12-07 10:27:22,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:22,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193576056] [2019-12-07 10:27:22,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:22,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193576056] [2019-12-07 10:27:22,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:22,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:22,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260235338] [2019-12-07 10:27:22,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:22,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:22,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:22,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:22,789 INFO L87 Difference]: Start difference. First operand 487 states and 743 transitions. Second operand 4 states. [2019-12-07 10:27:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:23,047 INFO L93 Difference]: Finished difference Result 1038 states and 1565 transitions. [2019-12-07 10:27:23,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:23,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 10:27:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:23,050 INFO L225 Difference]: With dead ends: 1038 [2019-12-07 10:27:23,050 INFO L226 Difference]: Without dead ends: 558 [2019-12-07 10:27:23,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-12-07 10:27:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-12-07 10:27:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 740 transitions. [2019-12-07 10:27:23,061 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 740 transitions. Word has length 92 [2019-12-07 10:27:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:23,061 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 740 transitions. [2019-12-07 10:27:23,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 740 transitions. [2019-12-07 10:27:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 10:27:23,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:23,062 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:23,062 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1569413781, now seen corresponding path program 1 times [2019-12-07 10:27:23,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:23,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852740716] [2019-12-07 10:27:23,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:23,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852740716] [2019-12-07 10:27:23,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:23,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:23,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001377886] [2019-12-07 10:27:23,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:23,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:23,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:23,102 INFO L87 Difference]: Start difference. First operand 487 states and 740 transitions. Second operand 4 states. [2019-12-07 10:27:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:23,329 INFO L93 Difference]: Finished difference Result 1038 states and 1559 transitions. [2019-12-07 10:27:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:23,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 10:27:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:23,331 INFO L225 Difference]: With dead ends: 1038 [2019-12-07 10:27:23,331 INFO L226 Difference]: Without dead ends: 558 [2019-12-07 10:27:23,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-12-07 10:27:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-12-07 10:27:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 737 transitions. [2019-12-07 10:27:23,342 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 737 transitions. Word has length 93 [2019-12-07 10:27:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:23,342 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 737 transitions. [2019-12-07 10:27:23,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 737 transitions. [2019-12-07 10:27:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 10:27:23,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:23,343 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:23,343 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash 993375279, now seen corresponding path program 1 times [2019-12-07 10:27:23,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:23,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233924184] [2019-12-07 10:27:23,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:23,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233924184] [2019-12-07 10:27:23,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:23,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:23,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725480117] [2019-12-07 10:27:23,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:23,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:23,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:23,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:23,382 INFO L87 Difference]: Start difference. First operand 487 states and 737 transitions. Second operand 4 states. [2019-12-07 10:27:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:23,642 INFO L93 Difference]: Finished difference Result 1038 states and 1553 transitions. [2019-12-07 10:27:23,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:23,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 10:27:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:23,644 INFO L225 Difference]: With dead ends: 1038 [2019-12-07 10:27:23,644 INFO L226 Difference]: Without dead ends: 558 [2019-12-07 10:27:23,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-12-07 10:27:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-12-07 10:27:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 734 transitions. [2019-12-07 10:27:23,659 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 734 transitions. Word has length 94 [2019-12-07 10:27:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:23,659 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 734 transitions. [2019-12-07 10:27:23,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 734 transitions. [2019-12-07 10:27:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 10:27:23,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:23,661 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:23,661 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:23,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2070050586, now seen corresponding path program 1 times [2019-12-07 10:27:23,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:23,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669632869] [2019-12-07 10:27:23,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:23,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669632869] [2019-12-07 10:27:23,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:23,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:23,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235552338] [2019-12-07 10:27:23,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:23,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:23,723 INFO L87 Difference]: Start difference. First operand 487 states and 734 transitions. Second operand 4 states. [2019-12-07 10:27:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:23,999 INFO L93 Difference]: Finished difference Result 1011 states and 1514 transitions. [2019-12-07 10:27:23,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:23,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 10:27:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:24,001 INFO L225 Difference]: With dead ends: 1011 [2019-12-07 10:27:24,001 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 10:27:24,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 10:27:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-12-07 10:27:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 731 transitions. [2019-12-07 10:27:24,015 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 731 transitions. Word has length 95 [2019-12-07 10:27:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:24,015 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 731 transitions. [2019-12-07 10:27:24,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 731 transitions. [2019-12-07 10:27:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 10:27:24,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:24,017 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:24,017 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2066779273, now seen corresponding path program 1 times [2019-12-07 10:27:24,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:24,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776581837] [2019-12-07 10:27:24,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:24,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776581837] [2019-12-07 10:27:24,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:24,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:24,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45216138] [2019-12-07 10:27:24,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:24,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:24,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:24,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:24,071 INFO L87 Difference]: Start difference. First operand 487 states and 731 transitions. Second operand 4 states. [2019-12-07 10:27:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:24,305 INFO L93 Difference]: Finished difference Result 1011 states and 1508 transitions. [2019-12-07 10:27:24,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:24,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 10:27:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:24,307 INFO L225 Difference]: With dead ends: 1011 [2019-12-07 10:27:24,307 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 10:27:24,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 10:27:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-12-07 10:27:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 728 transitions. [2019-12-07 10:27:24,316 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 728 transitions. Word has length 95 [2019-12-07 10:27:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:24,317 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 728 transitions. [2019-12-07 10:27:24,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 728 transitions. [2019-12-07 10:27:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 10:27:24,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:24,318 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:24,318 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash 952822956, now seen corresponding path program 1 times [2019-12-07 10:27:24,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:24,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685174400] [2019-12-07 10:27:24,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:24,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685174400] [2019-12-07 10:27:24,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:24,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:24,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682873560] [2019-12-07 10:27:24,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:24,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:24,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:24,359 INFO L87 Difference]: Start difference. First operand 487 states and 728 transitions. Second operand 4 states. [2019-12-07 10:27:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:24,583 INFO L93 Difference]: Finished difference Result 999 states and 1485 transitions. [2019-12-07 10:27:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:24,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 10:27:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:24,585 INFO L225 Difference]: With dead ends: 999 [2019-12-07 10:27:24,585 INFO L226 Difference]: Without dead ends: 519 [2019-12-07 10:27:24,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-12-07 10:27:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 487. [2019-12-07 10:27:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 10:27:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 725 transitions. [2019-12-07 10:27:24,594 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 725 transitions. Word has length 96 [2019-12-07 10:27:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:24,594 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 725 transitions. [2019-12-07 10:27:24,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 725 transitions. [2019-12-07 10:27:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 10:27:24,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:24,595 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:24,595 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2019-12-07 10:27:24,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:24,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343508853] [2019-12-07 10:27:24,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:24,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343508853] [2019-12-07 10:27:24,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:24,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:24,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845071664] [2019-12-07 10:27:24,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:24,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:24,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:24,630 INFO L87 Difference]: Start difference. First operand 487 states and 725 transitions. Second operand 3 states. [2019-12-07 10:27:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:24,691 INFO L93 Difference]: Finished difference Result 986 states and 1470 transitions. [2019-12-07 10:27:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:24,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 10:27:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:24,694 INFO L225 Difference]: With dead ends: 986 [2019-12-07 10:27:24,694 INFO L226 Difference]: Without dead ends: 652 [2019-12-07 10:27:24,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-07 10:27:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2019-12-07 10:27:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-12-07 10:27:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 965 transitions. [2019-12-07 10:27:24,705 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 965 transitions. Word has length 98 [2019-12-07 10:27:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:24,705 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 965 transitions. [2019-12-07 10:27:24,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 965 transitions. [2019-12-07 10:27:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 10:27:24,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:24,706 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:24,706 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2019-12-07 10:27:24,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:24,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747666961] [2019-12-07 10:27:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 10:27:24,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747666961] [2019-12-07 10:27:24,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:24,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:24,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494620897] [2019-12-07 10:27:24,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:24,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:24,740 INFO L87 Difference]: Start difference. First operand 650 states and 965 transitions. Second operand 3 states. [2019-12-07 10:27:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:24,807 INFO L93 Difference]: Finished difference Result 1145 states and 1701 transitions. [2019-12-07 10:27:24,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:24,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 10:27:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:24,809 INFO L225 Difference]: With dead ends: 1145 [2019-12-07 10:27:24,809 INFO L226 Difference]: Without dead ends: 648 [2019-12-07 10:27:24,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-12-07 10:27:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-12-07 10:27:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-12-07 10:27:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 957 transitions. [2019-12-07 10:27:24,819 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 957 transitions. Word has length 98 [2019-12-07 10:27:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:24,820 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 957 transitions. [2019-12-07 10:27:24,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 957 transitions. [2019-12-07 10:27:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 10:27:24,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:24,821 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:24,821 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2019-12-07 10:27:24,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:24,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277445009] [2019-12-07 10:27:24,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:24,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277445009] [2019-12-07 10:27:24,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:24,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:24,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114618088] [2019-12-07 10:27:24,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:24,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:24,863 INFO L87 Difference]: Start difference. First operand 648 states and 957 transitions. Second operand 4 states. [2019-12-07 10:27:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:25,095 INFO L93 Difference]: Finished difference Result 1446 states and 2132 transitions. [2019-12-07 10:27:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:25,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 10:27:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:25,098 INFO L225 Difference]: With dead ends: 1446 [2019-12-07 10:27:25,098 INFO L226 Difference]: Without dead ends: 805 [2019-12-07 10:27:25,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-12-07 10:27:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 720. [2019-12-07 10:27:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1083 transitions. [2019-12-07 10:27:25,114 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1083 transitions. Word has length 100 [2019-12-07 10:27:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:25,115 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1083 transitions. [2019-12-07 10:27:25,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1083 transitions. [2019-12-07 10:27:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 10:27:25,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:25,117 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:25,117 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:25,117 INFO L82 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2019-12-07 10:27:25,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:25,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117786147] [2019-12-07 10:27:25,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:25,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117786147] [2019-12-07 10:27:25,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:25,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:25,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216368856] [2019-12-07 10:27:25,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:25,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:25,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:25,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:25,172 INFO L87 Difference]: Start difference. First operand 720 states and 1083 transitions. Second operand 4 states. [2019-12-07 10:27:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:25,425 INFO L93 Difference]: Finished difference Result 1515 states and 2252 transitions. [2019-12-07 10:27:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:25,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 10:27:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:25,428 INFO L225 Difference]: With dead ends: 1515 [2019-12-07 10:27:25,429 INFO L226 Difference]: Without dead ends: 802 [2019-12-07 10:27:25,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-07 10:27:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-12-07 10:27:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1080 transitions. [2019-12-07 10:27:25,440 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1080 transitions. Word has length 115 [2019-12-07 10:27:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:25,440 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1080 transitions. [2019-12-07 10:27:25,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1080 transitions. [2019-12-07 10:27:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 10:27:25,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:25,441 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:25,442 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2019-12-07 10:27:25,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:25,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440141347] [2019-12-07 10:27:25,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:25,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440141347] [2019-12-07 10:27:25,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:25,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:25,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664100965] [2019-12-07 10:27:25,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:25,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:25,486 INFO L87 Difference]: Start difference. First operand 720 states and 1080 transitions. Second operand 4 states. [2019-12-07 10:27:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:25,720 INFO L93 Difference]: Finished difference Result 1515 states and 2246 transitions. [2019-12-07 10:27:25,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:25,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 10:27:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:25,724 INFO L225 Difference]: With dead ends: 1515 [2019-12-07 10:27:25,724 INFO L226 Difference]: Without dead ends: 802 [2019-12-07 10:27:25,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-07 10:27:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-12-07 10:27:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1077 transitions. [2019-12-07 10:27:25,740 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1077 transitions. Word has length 115 [2019-12-07 10:27:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:25,741 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1077 transitions. [2019-12-07 10:27:25,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1077 transitions. [2019-12-07 10:27:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 10:27:25,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:25,742 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:25,743 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2019-12-07 10:27:25,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:25,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068809632] [2019-12-07 10:27:25,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:25,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068809632] [2019-12-07 10:27:25,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:25,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:25,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405488831] [2019-12-07 10:27:25,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:25,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:25,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:25,797 INFO L87 Difference]: Start difference. First operand 720 states and 1077 transitions. Second operand 4 states. [2019-12-07 10:27:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:26,017 INFO L93 Difference]: Finished difference Result 1515 states and 2240 transitions. [2019-12-07 10:27:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:26,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 10:27:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:26,020 INFO L225 Difference]: With dead ends: 1515 [2019-12-07 10:27:26,020 INFO L226 Difference]: Without dead ends: 802 [2019-12-07 10:27:26,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-07 10:27:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-12-07 10:27:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1074 transitions. [2019-12-07 10:27:26,031 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1074 transitions. Word has length 116 [2019-12-07 10:27:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:26,032 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1074 transitions. [2019-12-07 10:27:26,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1074 transitions. [2019-12-07 10:27:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 10:27:26,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:26,033 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:26,033 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:26,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2019-12-07 10:27:26,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:26,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826085079] [2019-12-07 10:27:26,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:26,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826085079] [2019-12-07 10:27:26,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:26,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:26,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695136005] [2019-12-07 10:27:26,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:26,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:26,075 INFO L87 Difference]: Start difference. First operand 720 states and 1074 transitions. Second operand 4 states. [2019-12-07 10:27:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:26,336 INFO L93 Difference]: Finished difference Result 1515 states and 2234 transitions. [2019-12-07 10:27:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:26,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 10:27:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:26,341 INFO L225 Difference]: With dead ends: 1515 [2019-12-07 10:27:26,341 INFO L226 Difference]: Without dead ends: 802 [2019-12-07 10:27:26,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-07 10:27:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-12-07 10:27:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1071 transitions. [2019-12-07 10:27:26,354 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1071 transitions. Word has length 117 [2019-12-07 10:27:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:26,354 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1071 transitions. [2019-12-07 10:27:26,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1071 transitions. [2019-12-07 10:27:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 10:27:26,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:26,356 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:26,356 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:26,356 INFO L82 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2019-12-07 10:27:26,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:26,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464360131] [2019-12-07 10:27:26,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:26,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464360131] [2019-12-07 10:27:26,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:26,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:26,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394124791] [2019-12-07 10:27:26,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:26,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:26,399 INFO L87 Difference]: Start difference. First operand 720 states and 1071 transitions. Second operand 4 states. [2019-12-07 10:27:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:26,642 INFO L93 Difference]: Finished difference Result 1488 states and 2195 transitions. [2019-12-07 10:27:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:26,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 10:27:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:26,646 INFO L225 Difference]: With dead ends: 1488 [2019-12-07 10:27:26,646 INFO L226 Difference]: Without dead ends: 775 [2019-12-07 10:27:26,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:26,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-07 10:27:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 720. [2019-12-07 10:27:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1068 transitions. [2019-12-07 10:27:26,659 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1068 transitions. Word has length 118 [2019-12-07 10:27:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:26,659 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1068 transitions. [2019-12-07 10:27:26,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1068 transitions. [2019-12-07 10:27:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 10:27:26,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:26,660 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:26,661 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2019-12-07 10:27:26,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:26,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946446196] [2019-12-07 10:27:26,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 133 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 10:27:26,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946446196] [2019-12-07 10:27:26,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490750898] [2019-12-07 10:27:26,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:27:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:26,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:27:26,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:26,930 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:27:26,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:27:26,930 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:26,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:26,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:26,935 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:27:26,957 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:27:26,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:27:26,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:26,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:26,960 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:26,960 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:27:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:26,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:27:26,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-12-07 10:27:26,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145908365] [2019-12-07 10:27:26,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:26,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:26,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:26,989 INFO L87 Difference]: Start difference. First operand 720 states and 1068 transitions. Second operand 4 states. [2019-12-07 10:27:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:27,285 INFO L93 Difference]: Finished difference Result 1488 states and 2189 transitions. [2019-12-07 10:27:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:27,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 10:27:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:27,289 INFO L225 Difference]: With dead ends: 1488 [2019-12-07 10:27:27,289 INFO L226 Difference]: Without dead ends: 775 [2019-12-07 10:27:27,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:27:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-07 10:27:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 720. [2019-12-07 10:27:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-12-07 10:27:27,303 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 118 [2019-12-07 10:27:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:27,304 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-12-07 10:27:27,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-12-07 10:27:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 10:27:27,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:27,305 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:27,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:27:27,506 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:27,506 INFO L82 PathProgramCache]: Analyzing trace with hash 405159276, now seen corresponding path program 1 times [2019-12-07 10:27:27,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:27,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540513175] [2019-12-07 10:27:27,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 134 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 10:27:27,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540513175] [2019-12-07 10:27:27,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484702982] [2019-12-07 10:27:27,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:27:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:27,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:27:27,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:27,707 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:27:27,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:27:27,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:27,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:27,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:27,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:27:27,724 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:27:27,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:27:27,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:27,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:27,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:27,726 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:27:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:27,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:27:27,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-12-07 10:27:27,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903423158] [2019-12-07 10:27:27,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:27,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:27,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:27,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:27,743 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 4 states. [2019-12-07 10:27:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:27,987 INFO L93 Difference]: Finished difference Result 1476 states and 2167 transitions. [2019-12-07 10:27:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:27,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 10:27:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:27,990 INFO L225 Difference]: With dead ends: 1476 [2019-12-07 10:27:27,990 INFO L226 Difference]: Without dead ends: 763 [2019-12-07 10:27:27,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:27:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-12-07 10:27:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 720. [2019-12-07 10:27:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 10:27:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2019-12-07 10:27:28,001 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 119 [2019-12-07 10:27:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:28,001 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2019-12-07 10:27:28,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2019-12-07 10:27:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 10:27:28,002 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:28,002 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:28,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:27:28,203 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2019-12-07 10:27:28,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:28,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318423716] [2019-12-07 10:27:28,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-12-07 10:27:28,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318423716] [2019-12-07 10:27:28,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:28,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:28,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087846229] [2019-12-07 10:27:28,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:28,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:28,350 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 4 states. [2019-12-07 10:27:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:28,525 INFO L93 Difference]: Finished difference Result 1437 states and 2118 transitions. [2019-12-07 10:27:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:28,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 10:27:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:28,529 INFO L225 Difference]: With dead ends: 1437 [2019-12-07 10:27:28,529 INFO L226 Difference]: Without dead ends: 724 [2019-12-07 10:27:28,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-12-07 10:27:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 723. [2019-12-07 10:27:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-12-07 10:27:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1065 transitions. [2019-12-07 10:27:28,543 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1065 transitions. Word has length 122 [2019-12-07 10:27:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:28,544 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1065 transitions. [2019-12-07 10:27:28,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1065 transitions. [2019-12-07 10:27:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 10:27:28,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:28,545 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:28,545 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-12-07 10:27:28,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:28,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761906686] [2019-12-07 10:27:28,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:27:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:27:28,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:27:28,887 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:27:28,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:27:28 BoogieIcfgContainer [2019-12-07 10:27:28,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:27:28,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:27:28,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:27:28,980 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:27:28,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:19" (3/4) ... [2019-12-07 10:27:28,983 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:27:28,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:27:28,984 INFO L168 Benchmark]: Toolchain (without parser) took 10945.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 942.5 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:27:28,984 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:27:28,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:27:28,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:27:28,985 INFO L168 Benchmark]: Boogie Preprocessor took 50.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:27:28,985 INFO L168 Benchmark]: RCFGBuilder took 696.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.4 MB in the end (delta: 88.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:27:28,985 INFO L168 Benchmark]: TraceAbstraction took 9744.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 211.8 MB). Free memory was 974.4 MB in the beginning and 1.2 GB in the end (delta: -192.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:27:28,985 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:27:28,987 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 696.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.4 MB in the end (delta: 88.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9744.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 211.8 MB). Free memory was 974.4 MB in the beginning and 1.2 GB in the end (delta: -192.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={7:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1077] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={7:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={7:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={7:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={7:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [init=1, SSLv3_client_data={7:0}] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [init=1, SSLv3_client_data={7:0}] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [init=1, SSLv3_client_data={7:0}] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [init=1, SSLv3_client_data={7:0}] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [init=1, SSLv3_client_data={7:0}] [L1326] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={7:0}] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [init=1, SSLv3_client_data={7:0}] [L1339] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={7:0}] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [init=1, SSLv3_client_data={7:0}] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={7:0}] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={7:0}] [L1645] __VERIFIER_error() VAL [init=1, SSLv3_client_data={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.6s, OverallIterations: 29, TraceHistogramMax: 7, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5873 SDtfs, 1600 SDslu, 7516 SDs, 0 SdLazy, 3542 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 287 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=723occurred in iteration=28, 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, 28 MinimizatonAttempts, 1352 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2817 NumberOfCodeBlocks, 2817 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2650 ConstructedInterpolants, 0 QuantifiedInterpolants, 666611 SizeOfPredicates, 6 NumberOfNonLiveVariables, 949 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 30 InterpolantComputations, 28 PerfectInterpolantSequences, 3033/3035 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 10:27:30,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:27:30,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:27:30,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:27:30,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:27:30,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:27:30,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:27:30,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:27:30,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:27:30,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:27:30,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:27:30,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:27:30,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:27:30,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:27:30,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:27:30,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:27:30,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:27:30,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:27:30,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:27:30,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:27:30,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:27:30,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:27:30,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:27:30,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:27:30,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:27:30,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:27:30,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:27:30,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:27:30,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:27:30,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:27:30,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:27:30,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:27:30,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:27:30,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:27:30,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:27:30,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:27:30,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:27:30,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:27:30,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:27:30,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:27:30,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:27:30,394 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 10:27:30,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:27:30,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:27:30,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:27:30,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:27:30,405 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:27:30,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:27:30,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:27:30,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:27:30,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:27:30,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:27:30,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:27:30,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:27:30,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:27:30,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:27:30,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:27:30,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:27:30,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:27:30,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:27:30,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:27:30,408 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 10:27:30,408 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:27:30,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:27:30,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:27:30,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:27:30,409 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/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 -> 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f [2019-12-07 10:27:30,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:27:30,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:27:30,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:27:30,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:27:30,595 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:27:30,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/../../sv-benchmarks/c/loops/s3.i [2019-12-07 10:27:30,643 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/deee38e62/4b1e8534323d4d428fe7133b38eaa089/FLAG4b9379f26 [2019-12-07 10:27:31,125 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:27:31,125 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/sv-benchmarks/c/loops/s3.i [2019-12-07 10:27:31,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/deee38e62/4b1e8534323d4d428fe7133b38eaa089/FLAG4b9379f26 [2019-12-07 10:27:31,422 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/data/deee38e62/4b1e8534323d4d428fe7133b38eaa089 [2019-12-07 10:27:31,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:27:31,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:27:31,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:27:31,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:27:31,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:27:31,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ecdc202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31, skipping insertion in model container [2019-12-07 10:27:31,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:27:31,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:27:31,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:27:31,758 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:27:31,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:27:31,833 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:27:31,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31 WrapperNode [2019-12-07 10:27:31,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:27:31,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:27:31,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:27:31,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:27:31,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:27:31,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:27:31,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:27:31,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:27:31,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... [2019-12-07 10:27:31,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:27:31,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:27:31,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:27:31,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:27:31,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:27:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:27:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:27:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:27:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:27:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:27:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:27:31,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:27:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:27:32,144 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 10:27:34,415 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 10:27:34,416 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 10:27:34,417 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:27:34,417 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:27:34,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:34 BoogieIcfgContainer [2019-12-07 10:27:34,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:27:34,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:27:34,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:27:34,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:27:34,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:27:31" (1/3) ... [2019-12-07 10:27:34,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3562f8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:27:34, skipping insertion in model container [2019-12-07 10:27:34,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:31" (2/3) ... [2019-12-07 10:27:34,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3562f8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:27:34, skipping insertion in model container [2019-12-07 10:27:34,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:34" (3/3) ... [2019-12-07 10:27:34,423 INFO L109 eAbstractionObserver]: Analyzing ICFG s3.i [2019-12-07 10:27:34,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:27:34,434 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:27:34,441 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:27:34,458 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:27:34,458 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:27:34,458 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:27:34,458 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:27:34,458 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:27:34,459 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:27:34,459 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:27:34,459 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:27:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-12-07 10:27:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:27:34,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:34,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:34,478 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-12-07 10:27:34,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:27:34,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517390184] [2019-12-07 10:27:34,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 10:27:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:34,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:27:34,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:34,642 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:27:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:34,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517390184] [2019-12-07 10:27:34,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:34,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:27:34,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811431476] [2019-12-07 10:27:34,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:34,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:27:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:34,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:34,672 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-12-07 10:27:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:34,754 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-12-07 10:27:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:34,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 10:27:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:34,768 INFO L225 Difference]: With dead ends: 375 [2019-12-07 10:27:34,768 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 10:27:34,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 10:27:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-12-07 10:27:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 10:27:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2019-12-07 10:27:34,817 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 24 [2019-12-07 10:27:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:34,818 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2019-12-07 10:27:34,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2019-12-07 10:27:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:27:34,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:34,821 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:35,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:27:35,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:35,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1495258694, now seen corresponding path program 1 times [2019-12-07 10:27:35,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:27:35,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890935638] [2019-12-07 10:27:35,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 10:27:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:35,202 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:27:35,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:35,213 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:27:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:35,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890935638] [2019-12-07 10:27:35,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:35,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:27:35,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054092072] [2019-12-07 10:27:35,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:35,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:27:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:35,229 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand 4 states. [2019-12-07 10:27:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:37,167 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2019-12-07 10:27:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:37,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 10:27:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:37,170 INFO L225 Difference]: With dead ends: 528 [2019-12-07 10:27:37,170 INFO L226 Difference]: Without dead ends: 421 [2019-12-07 10:27:37,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-07 10:27:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-12-07 10:27:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-07 10:27:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-12-07 10:27:37,200 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 41 [2019-12-07 10:27:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:37,200 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-12-07 10:27:37,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-12-07 10:27:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 10:27:37,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:37,206 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:37,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:27:37,407 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 924360661, now seen corresponding path program 1 times [2019-12-07 10:27:37,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:27:37,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657720014] [2019-12-07 10:27:37,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:27:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:37,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:27:37,561 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:27:37,571 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:27:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:27:37,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657720014] [2019-12-07 10:27:37,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:37,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:27:37,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444671882] [2019-12-07 10:27:37,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:37,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:27:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:37,588 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-12-07 10:27:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:39,659 INFO L93 Difference]: Finished difference Result 939 states and 1394 transitions. [2019-12-07 10:27:39,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:39,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 10:27:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:39,664 INFO L225 Difference]: With dead ends: 939 [2019-12-07 10:27:39,664 INFO L226 Difference]: Without dead ends: 628 [2019-12-07 10:27:39,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-12-07 10:27:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-12-07 10:27:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-12-07 10:27:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2019-12-07 10:27:39,693 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 80 [2019-12-07 10:27:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:39,694 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2019-12-07 10:27:39,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2019-12-07 10:27:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 10:27:39,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:39,698 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:39,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:27:39,899 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2019-12-07 10:27:39,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:27:39,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045923953] [2019-12-07 10:27:39,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 10:27:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:40,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:27:40,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:40,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:27:40,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:40,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:40,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:40,161 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 10:27:40,188 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:27:40,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 10:27:40,189 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:40,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:40,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:40,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 10:27:40,216 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:27:40,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:27:40,217 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:40,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:40,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:40,219 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:27:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:27:40,238 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:27:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:27:40,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045923953] [2019-12-07 10:27:40,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:40,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 10:27:40,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584807443] [2019-12-07 10:27:40,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:27:40,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:27:40,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:27:40,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:40,279 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand 7 states. [2019-12-07 10:27:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:50,844 INFO L93 Difference]: Finished difference Result 2264 states and 3359 transitions. [2019-12-07 10:27:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:27:50,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-07 10:27:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:50,853 INFO L225 Difference]: With dead ends: 2264 [2019-12-07 10:27:50,853 INFO L226 Difference]: Without dead ends: 1643 [2019-12-07 10:27:50,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:27:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-12-07 10:27:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 753. [2019-12-07 10:27:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-07 10:27:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1136 transitions. [2019-12-07 10:27:50,882 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1136 transitions. Word has length 100 [2019-12-07 10:27:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:50,882 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1136 transitions. [2019-12-07 10:27:50,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:27:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1136 transitions. [2019-12-07 10:27:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 10:27:50,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:50,884 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:51,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:27:51,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2019-12-07 10:27:51,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:27:51,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870756553] [2019-12-07 10:27:51,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 10:27:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:51,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:27:51,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:51,302 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:27:51,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:27:51,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:51,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:51,310 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:51,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:27:51,325 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:27:51,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:27:51,326 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:51,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:51,328 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:51,328 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:27:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:51,344 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:27:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:51,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870756553] [2019-12-07 10:27:51,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:51,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 10:27:51,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951710088] [2019-12-07 10:27:51,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:51,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:27:51,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:51,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:51,368 INFO L87 Difference]: Start difference. First operand 753 states and 1136 transitions. Second operand 5 states. [2019-12-07 10:27:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:55,717 INFO L93 Difference]: Finished difference Result 1757 states and 2634 transitions. [2019-12-07 10:27:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:27:55,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-07 10:27:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:55,724 INFO L225 Difference]: With dead ends: 1757 [2019-12-07 10:27:55,724 INFO L226 Difference]: Without dead ends: 1011 [2019-12-07 10:27:55,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:27:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-07 10:27:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 873. [2019-12-07 10:27:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-12-07 10:27:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1341 transitions. [2019-12-07 10:27:55,750 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1341 transitions. Word has length 100 [2019-12-07 10:27:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:55,750 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1341 transitions. [2019-12-07 10:27:55,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1341 transitions. [2019-12-07 10:27:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 10:27:55,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:55,752 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:55,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:27:55,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2019-12-07 10:27:55,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:27:55,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589845949] [2019-12-07 10:27:55,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 10:27:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:56,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:27:56,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:27:56,204 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:27:56,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:27:56,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:56,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:56,213 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:56,213 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:27:56,229 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:27:56,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:27:56,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:56,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:56,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:56,232 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:27:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:56,251 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:27:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:27:56,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589845949] [2019-12-07 10:27:56,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:56,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:27:56,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885582772] [2019-12-07 10:27:56,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:27:56,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:27:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:27:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:27:56,293 INFO L87 Difference]: Start difference. First operand 873 states and 1341 transitions. Second operand 6 states. [2019-12-07 10:28:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:03,807 INFO L93 Difference]: Finished difference Result 2393 states and 3607 transitions. [2019-12-07 10:28:03,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:28:03,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-12-07 10:28:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:03,816 INFO L225 Difference]: With dead ends: 2393 [2019-12-07 10:28:03,816 INFO L226 Difference]: Without dead ends: 1527 [2019-12-07 10:28:03,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:28:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-12-07 10:28:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 928. [2019-12-07 10:28:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-07 10:28:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1410 transitions. [2019-12-07 10:28:03,854 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1410 transitions. Word has length 115 [2019-12-07 10:28:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:03,854 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1410 transitions. [2019-12-07 10:28:03,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1410 transitions. [2019-12-07 10:28:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 10:28:03,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:03,857 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:04,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 10:28:04,058 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2019-12-07 10:28:04,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:28:04,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063747532] [2019-12-07 10:28:04,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 10:28:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:04,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:28:04,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:04,288 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:28:04,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:28:04,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:04,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:04,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:04,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:28:04,309 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:28:04,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:28:04,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:04,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:04,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:04,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:28:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:28:04,324 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:28:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:28:04,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063747532] [2019-12-07 10:28:04,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:04,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:28:04,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725813094] [2019-12-07 10:28:04,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:04,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:28:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:04,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:04,350 INFO L87 Difference]: Start difference. First operand 928 states and 1410 transitions. Second operand 6 states. [2019-12-07 10:28:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:11,977 INFO L93 Difference]: Finished difference Result 2452 states and 3665 transitions. [2019-12-07 10:28:11,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:28:11,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-12-07 10:28:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:11,985 INFO L225 Difference]: With dead ends: 2452 [2019-12-07 10:28:11,985 INFO L226 Difference]: Without dead ends: 1531 [2019-12-07 10:28:11,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:28:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-12-07 10:28:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 936. [2019-12-07 10:28:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-12-07 10:28:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1408 transitions. [2019-12-07 10:28:12,010 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1408 transitions. Word has length 115 [2019-12-07 10:28:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:12,010 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 1408 transitions. [2019-12-07 10:28:12,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1408 transitions. [2019-12-07 10:28:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 10:28:12,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:12,012 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:12,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 10:28:12,213 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash -647023955, now seen corresponding path program 1 times [2019-12-07 10:28:12,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:28:12,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97975563] [2019-12-07 10:28:12,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 10:28:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:12,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:28:12,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:12,465 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:28:12,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:28:12,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:12,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:12,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:12,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:28:12,491 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:28:12,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:28:12,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:12,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:12,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:12,493 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:28:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:28:12,507 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:28:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:28:12,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97975563] [2019-12-07 10:28:12,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:12,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:28:12,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970292636] [2019-12-07 10:28:12,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:12,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:28:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:12,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:12,534 INFO L87 Difference]: Start difference. First operand 936 states and 1408 transitions. Second operand 6 states. [2019-12-07 10:28:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:22,969 INFO L93 Difference]: Finished difference Result 2419 states and 3598 transitions. [2019-12-07 10:28:22,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:28:22,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-12-07 10:28:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:22,976 INFO L225 Difference]: With dead ends: 2419 [2019-12-07 10:28:22,976 INFO L226 Difference]: Without dead ends: 1651 [2019-12-07 10:28:22,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:28:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-12-07 10:28:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1052. [2019-12-07 10:28:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-12-07 10:28:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1582 transitions. [2019-12-07 10:28:23,013 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1582 transitions. Word has length 115 [2019-12-07 10:28:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:23,013 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1582 transitions. [2019-12-07 10:28:23,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1582 transitions. [2019-12-07 10:28:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 10:28:23,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:23,016 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:23,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 10:28:23,216 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 336272896, now seen corresponding path program 1 times [2019-12-07 10:28:23,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:28:23,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635626247] [2019-12-07 10:28:23,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 10:28:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:23,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:28:23,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:23,454 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:28:23,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:28:23,454 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:23,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:23,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:23,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:28:23,476 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:28:23,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:28:23,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:23,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:23,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:23,478 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:28:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 10:28:23,492 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:28:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 10:28:23,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635626247] [2019-12-07 10:28:23,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:23,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:28:23,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736516581] [2019-12-07 10:28:23,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:23,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:28:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:23,520 INFO L87 Difference]: Start difference. First operand 1052 states and 1582 transitions. Second operand 6 states. [2019-12-07 10:28:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:34,358 INFO L93 Difference]: Finished difference Result 2673 states and 3958 transitions. [2019-12-07 10:28:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:28:34,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-12-07 10:28:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:34,366 INFO L225 Difference]: With dead ends: 2673 [2019-12-07 10:28:34,366 INFO L226 Difference]: Without dead ends: 1631 [2019-12-07 10:28:34,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:28:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-12-07 10:28:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1054. [2019-12-07 10:28:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-12-07 10:28:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1563 transitions. [2019-12-07 10:28:34,394 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1563 transitions. Word has length 117 [2019-12-07 10:28:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:34,394 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1563 transitions. [2019-12-07 10:28:34,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1563 transitions. [2019-12-07 10:28:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 10:28:34,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:34,396 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:34,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 10:28:34,597 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 475530403, now seen corresponding path program 1 times [2019-12-07 10:28:34,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:28:34,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738541216] [2019-12-07 10:28:34,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 10:28:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:34,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:28:34,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:34,835 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:28:34,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:28:34,836 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:34,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:34,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:34,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:28:34,857 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:28:34,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:28:34,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:34,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:34,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:34,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:28:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 10:28:34,874 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:28:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 10:28:34,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738541216] [2019-12-07 10:28:34,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:34,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:28:34,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385079788] [2019-12-07 10:28:34,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:34,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:28:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:34,902 INFO L87 Difference]: Start difference. First operand 1054 states and 1563 transitions. Second operand 6 states. [2019-12-07 10:28:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:42,208 INFO L93 Difference]: Finished difference Result 2486 states and 3653 transitions. [2019-12-07 10:28:42,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:28:42,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-12-07 10:28:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:42,215 INFO L225 Difference]: With dead ends: 2486 [2019-12-07 10:28:42,215 INFO L226 Difference]: Without dead ends: 1622 [2019-12-07 10:28:42,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:28:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-12-07 10:28:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1065. [2019-12-07 10:28:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-12-07 10:28:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1569 transitions. [2019-12-07 10:28:42,242 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1569 transitions. Word has length 117 [2019-12-07 10:28:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:42,242 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1569 transitions. [2019-12-07 10:28:42,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1569 transitions. [2019-12-07 10:28:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 10:28:42,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:42,244 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:42,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 10:28:42,446 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2019-12-07 10:28:42,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:28:42,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801708915] [2019-12-07 10:28:42,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 10:28:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:42,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:28:42,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:42,761 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:28:42,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:28:42,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:42,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:42,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:42,769 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:28:42,783 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:28:42,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:28:42,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:42,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:42,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:42,785 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:28:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:28:42,800 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:28:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:28:42,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801708915] [2019-12-07 10:28:42,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:42,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:28:42,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74086964] [2019-12-07 10:28:42,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:42,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:28:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:42,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:42,836 INFO L87 Difference]: Start difference. First operand 1065 states and 1569 transitions. Second operand 6 states. [2019-12-07 10:28:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:52,746 INFO L93 Difference]: Finished difference Result 2674 states and 3896 transitions. [2019-12-07 10:28:52,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:28:52,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-12-07 10:28:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:52,753 INFO L225 Difference]: With dead ends: 2674 [2019-12-07 10:28:52,753 INFO L226 Difference]: Without dead ends: 1621 [2019-12-07 10:28:52,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:28:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2019-12-07 10:28:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1065. [2019-12-07 10:28:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-12-07 10:28:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1547 transitions. [2019-12-07 10:28:52,780 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1547 transitions. Word has length 132 [2019-12-07 10:28:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:52,781 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1547 transitions. [2019-12-07 10:28:52,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1547 transitions. [2019-12-07 10:28:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:28:52,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:52,782 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:52,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 10:28:52,983 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2019-12-07 10:28:52,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:28:52,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890947618] [2019-12-07 10:28:52,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 10:28:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:53,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:28:53,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:53,290 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:28:53,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:28:53,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:53,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:53,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:53,299 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:28:53,313 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:28:53,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:28:53,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:53,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:53,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:53,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:28:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:28:53,333 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:28:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:28:53,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890947618] [2019-12-07 10:28:53,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:53,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:28:53,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993769175] [2019-12-07 10:28:53,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:53,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:28:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:53,360 INFO L87 Difference]: Start difference. First operand 1065 states and 1547 transitions. Second operand 6 states. [2019-12-07 10:29:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:03,433 INFO L93 Difference]: Finished difference Result 2629 states and 3797 transitions. [2019-12-07 10:29:03,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:29:03,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-12-07 10:29:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:03,440 INFO L225 Difference]: With dead ends: 2629 [2019-12-07 10:29:03,440 INFO L226 Difference]: Without dead ends: 1576 [2019-12-07 10:29:03,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:29:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-12-07 10:29:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1065. [2019-12-07 10:29:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-12-07 10:29:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1525 transitions. [2019-12-07 10:29:03,469 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1525 transitions. Word has length 133 [2019-12-07 10:29:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:03,469 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1525 transitions. [2019-12-07 10:29:03,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:29:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1525 transitions. [2019-12-07 10:29:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:29:03,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:03,471 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:03,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 10:29:03,672 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:29:03,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:03,672 INFO L82 PathProgramCache]: Analyzing trace with hash -197856968, now seen corresponding path program 1 times [2019-12-07 10:29:03,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:29:03,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364691929] [2019-12-07 10:29:03,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 10:29:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:03,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:29:03,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:03,996 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:29:03,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:29:03,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:04,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:04,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:04,004 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:29:04,019 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:29:04,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:29:04,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:04,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:04,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:04,021 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:29:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:29:04,038 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:29:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:29:04,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364691929] [2019-12-07 10:29:04,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:29:04,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:29:04,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606260479] [2019-12-07 10:29:04,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:29:04,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:29:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:29:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:29:04,076 INFO L87 Difference]: Start difference. First operand 1065 states and 1525 transitions. Second operand 6 states. [2019-12-07 10:29:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:12,109 INFO L93 Difference]: Finished difference Result 2729 states and 3888 transitions. [2019-12-07 10:29:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:29:12,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-12-07 10:29:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:12,116 INFO L225 Difference]: With dead ends: 2729 [2019-12-07 10:29:12,116 INFO L226 Difference]: Without dead ends: 1676 [2019-12-07 10:29:12,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:29:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-12-07 10:29:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1160. [2019-12-07 10:29:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-12-07 10:29:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1639 transitions. [2019-12-07 10:29:12,145 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1639 transitions. Word has length 133 [2019-12-07 10:29:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:12,145 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1639 transitions. [2019-12-07 10:29:12,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:29:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1639 transitions. [2019-12-07 10:29:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:29:12,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:12,147 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:12,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 10:29:12,347 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:29:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 584684213, now seen corresponding path program 1 times [2019-12-07 10:29:12,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:29:12,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002519558] [2019-12-07 10:29:12,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 10:29:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:12,611 INFO L264 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:29:12,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:12,628 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:29:12,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:29:12,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:12,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:12,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:12,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:29:12,648 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:29:12,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:29:12,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:12,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:12,650 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:12,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:29:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:29:12,668 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:29:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:29:12,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002519558] [2019-12-07 10:29:12,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:29:12,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:29:12,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985304392] [2019-12-07 10:29:12,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:29:12,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:29:12,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:29:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:29:12,697 INFO L87 Difference]: Start difference. First operand 1160 states and 1639 transitions. Second operand 6 states. [2019-12-07 10:29:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:19,414 INFO L93 Difference]: Finished difference Result 2783 states and 3932 transitions. [2019-12-07 10:29:19,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:29:19,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-12-07 10:29:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:19,421 INFO L225 Difference]: With dead ends: 2783 [2019-12-07 10:29:19,421 INFO L226 Difference]: Without dead ends: 1635 [2019-12-07 10:29:19,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:29:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2019-12-07 10:29:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1176. [2019-12-07 10:29:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-12-07 10:29:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1660 transitions. [2019-12-07 10:29:19,451 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1660 transitions. Word has length 134 [2019-12-07 10:29:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:19,451 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1660 transitions. [2019-12-07 10:29:19,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:29:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1660 transitions. [2019-12-07 10:29:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:29:19,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:19,452 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:19,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 10:29:19,653 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:29:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2002780513, now seen corresponding path program 1 times [2019-12-07 10:29:19,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:29:19,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309756893] [2019-12-07 10:29:19,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 10:29:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:29:19,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:19,942 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:29:19,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 10:29:19,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:19,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:19,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:19,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 10:29:19,965 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:29:19,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:29:19,965 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:19,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:19,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:19,967 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:29:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:29:19,984 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:29:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:29:20,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309756893] [2019-12-07 10:29:20,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:29:20,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:29:20,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588433083] [2019-12-07 10:29:20,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:29:20,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:29:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:29:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:29:20,023 INFO L87 Difference]: Start difference. First operand 1176 states and 1660 transitions. Second operand 6 states. [2019-12-07 10:29:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:28,910 INFO L93 Difference]: Finished difference Result 2777 states and 3913 transitions. [2019-12-07 10:29:28,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:29:28,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-12-07 10:29:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:28,917 INFO L225 Difference]: With dead ends: 2777 [2019-12-07 10:29:28,917 INFO L226 Difference]: Without dead ends: 1613 [2019-12-07 10:29:28,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:29:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2019-12-07 10:29:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1176. [2019-12-07 10:29:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-12-07 10:29:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1644 transitions. [2019-12-07 10:29:28,948 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1644 transitions. Word has length 134 [2019-12-07 10:29:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:28,948 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1644 transitions. [2019-12-07 10:29:28,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:29:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1644 transitions. [2019-12-07 10:29:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 10:29:28,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:28,949 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:29,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 10:29:29,150 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:29:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-12-07 10:29:29,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:29:29,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492043463] [2019-12-07 10:29:29,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 10:29:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:29:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:29:30,273 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 10:29:30,273 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:29:30,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 10:29:30,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:29:30 BoogieIcfgContainer [2019-12-07 10:29:30,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:29:30,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:29:30,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:29:30,572 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:29:30,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:34" (3/4) ... [2019-12-07 10:29:30,574 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:29:30,644 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0bd72701-2ee8-414c-911c-73910e2aac7e/bin/uautomizer/witness.graphml [2019-12-07 10:29:30,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:29:30,645 INFO L168 Benchmark]: Toolchain (without parser) took 119217.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 947.0 MB in the beginning and 975.2 MB in the end (delta: -28.2 MB). Peak memory consumption was 200.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:29:30,645 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:29:30,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.0 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:29:30,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:29:30,646 INFO L168 Benchmark]: Boogie Preprocessor took 51.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:29:30,646 INFO L168 Benchmark]: RCFGBuilder took 2479.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:29:30,646 INFO L168 Benchmark]: TraceAbstraction took 116153.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 969.0 MB in the beginning and 992.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 94.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:29:30,647 INFO L168 Benchmark]: Witness Printer took 71.82 ms. Allocated memory is still 1.3 GB. Free memory was 992.8 MB in the beginning and 975.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:29:30,648 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.0 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2479.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 116153.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 969.0 MB in the beginning and 992.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 94.2 MB. Max. memory is 11.5 GB. * Witness Printer took 71.82 ms. Allocated memory is still 1.3 GB. Free memory was 992.8 MB in the beginning and 975.2 MB 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: 1645]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={15:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1077] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={15:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={15:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={15:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={15:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={15:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [init=1, SSLv3_client_data={15:0}] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [init=1, SSLv3_client_data={15:0}] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [init=1, SSLv3_client_data={15:0}] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [init=1, SSLv3_client_data={15:0}] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [init=1, SSLv3_client_data={15:0}] [L1326] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={15:0}] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [init=1, SSLv3_client_data={15:0}] [L1339] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={15:0}] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [init=1, SSLv3_client_data={15:0}] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={15:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={15:0}] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={15:0}] [L1645] __VERIFIER_error() VAL [init=1, SSLv3_client_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 116.0s, OverallIterations: 16, TraceHistogramMax: 7, AutomataDifference: 106.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2813 SDtfs, 3038 SDslu, 5984 SDs, 0 SdLazy, 5177 SolverSat, 588 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 101.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3173 GetRequests, 3095 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1176occurred in iteration=14, 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, 15 MinimizatonAttempts, 6434 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1727 NumberOfCodeBlocks, 1727 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3150 ConstructedInterpolants, 0 QuantifiedInterpolants, 834823 SizeOfPredicates, 71 NumberOfNonLiveVariables, 4164 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 4372/4372 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...