./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/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 eed6d14b3659ee573ecc9a025ea4a6cd48efa35c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 11:21:42,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:21:42,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:21:42,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:21:42,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:21:42,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:21:42,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:21:42,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:21:42,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:21:42,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:21:42,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:21:42,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:21:42,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:21:42,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:21:42,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:21:42,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:21:42,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:21:42,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:21:42,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:21:42,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:21:42,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:21:42,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:21:42,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:21:42,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:21:42,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:21:42,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:21:42,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:21:42,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:21:42,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:21:42,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:21:42,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:21:42,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:21:42,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:21:42,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:21:42,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:21:42,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:21:42,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:21:42,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:21:42,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:21:42,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:21:42,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:21:42,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 11:21:42,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:21:42,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:21:42,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:21:42,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:21:42,742 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:21:42,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:21:42,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:21:42,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:21:42,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:21:42,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:21:42,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:21:42,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:21:42,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:21:42,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:21:42,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:21:42,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:21:42,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:21:42,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:21:42,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:21:42,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:21:42,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:21:42,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:21:42,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:21:42,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:21:42,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:21:42,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:21:42,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:21:42,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:21:42,761 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_00baa3cc-2f46-4537-8f88-2a581f190d70/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 -> eed6d14b3659ee573ecc9a025ea4a6cd48efa35c [2019-11-20 11:21:42,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:21:42,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:21:42,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:21:42,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:21:42,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:21:42,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-20 11:21:43,002 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/data/62e2d871e/91d04af9a8994336a85962b9620025e1/FLAGbadf55dd8 [2019-11-20 11:21:43,485 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:21:43,486 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-20 11:21:43,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/data/62e2d871e/91d04af9a8994336a85962b9620025e1/FLAGbadf55dd8 [2019-11-20 11:21:43,758 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/data/62e2d871e/91d04af9a8994336a85962b9620025e1 [2019-11-20 11:21:43,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:21:43,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:21:43,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:21:43,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:21:43,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:21:43,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:43" (1/1) ... [2019-11-20 11:21:43,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139efc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:43, skipping insertion in model container [2019-11-20 11:21:43,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:43" (1/1) ... [2019-11-20 11:21:43,780 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:21:43,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:21:44,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:21:44,357 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:21:44,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:21:44,491 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:21:44,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44 WrapperNode [2019-11-20 11:21:44,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:21:44,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:21:44,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:21:44,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:21:44,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:21:44,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:21:44,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:21:44,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:21:44,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... [2019-11-20 11:21:44,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:21:44,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:21:44,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:21:44,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:21:44,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/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-11-20 11:21:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 11:21:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 11:21:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:21:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:21:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:21:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:21:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:21:44,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:21:45,285 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:21:45,285 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-20 11:21:45,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:21:45 BoogieIcfgContainer [2019-11-20 11:21:45,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:21:45,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:21:45,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:21:45,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:21:45,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:21:43" (1/3) ... [2019-11-20 11:21:45,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c89963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:21:45, skipping insertion in model container [2019-11-20 11:21:45,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:44" (2/3) ... [2019-11-20 11:21:45,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c89963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:21:45, skipping insertion in model container [2019-11-20 11:21:45,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:21:45" (3/3) ... [2019-11-20 11:21:45,296 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2019-11-20 11:21:45,306 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:21:45,313 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:21:45,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:21:45,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:21:45,352 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:21:45,353 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:21:45,353 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:21:45,353 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:21:45,353 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:21:45,354 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:21:45,354 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:21:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-20 11:21:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 11:21:45,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:45,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:21:45,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash -372423763, now seen corresponding path program 1 times [2019-11-20 11:21:45,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:45,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157452890] [2019-11-20 11:21:45,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:21:45,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157452890] [2019-11-20 11:21:45,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:21:45,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:21:45,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560061405] [2019-11-20 11:21:45,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 11:21:45,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 11:21:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 11:21:45,554 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-11-20 11:21:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:45,574 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-11-20 11:21:45,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 11:21:45,575 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 11:21:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:45,586 INFO L225 Difference]: With dead ends: 98 [2019-11-20 11:21:45,586 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 11:21:45,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 11:21:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 11:21:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-20 11:21:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 11:21:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-11-20 11:21:45,628 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2019-11-20 11:21:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:45,628 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-11-20 11:21:45,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 11:21:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-11-20 11:21:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:21:45,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:45,630 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] [2019-11-20 11:21:45,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1965259271, now seen corresponding path program 1 times [2019-11-20 11:21:45,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:45,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448854452] [2019-11-20 11:21:45,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:21:45,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448854452] [2019-11-20 11:21:45,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:21:45,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:21:45,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142554156] [2019-11-20 11:21:45,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:21:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:21:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:21:45,696 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2019-11-20 11:21:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:45,721 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-20 11:21:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:21:45,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 11:21:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:45,725 INFO L225 Difference]: With dead ends: 71 [2019-11-20 11:21:45,725 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 11:21:45,726 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-11-20 11:21:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 11:21:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-20 11:21:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 11:21:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-11-20 11:21:45,736 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2019-11-20 11:21:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:45,736 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-11-20 11:21:45,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:21:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-11-20 11:21:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:21:45,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:45,738 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, 1, 1, 1] [2019-11-20 11:21:45,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1325693868, now seen corresponding path program 1 times [2019-11-20 11:21:45,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:45,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625441419] [2019-11-20 11:21:45,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:21:45,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625441419] [2019-11-20 11:21:45,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:21:45,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:21:45,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344392108] [2019-11-20 11:21:45,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:21:45,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:21:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:21:45,800 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2019-11-20 11:21:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:45,838 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-20 11:21:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:21:45,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 11:21:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:45,841 INFO L225 Difference]: With dead ends: 89 [2019-11-20 11:21:45,842 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 11:21:45,843 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-11-20 11:21:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 11:21:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-20 11:21:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 11:21:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2019-11-20 11:21:45,865 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 27 [2019-11-20 11:21:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:45,866 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2019-11-20 11:21:45,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:21:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2019-11-20 11:21:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:21:45,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:45,869 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, 1, 1, 1] [2019-11-20 11:21:45,870 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2143342318, now seen corresponding path program 1 times [2019-11-20 11:21:45,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:45,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244679465] [2019-11-20 11:21:45,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:45,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244679465] [2019-11-20 11:21:45,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:21:45,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:21:45,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330591864] [2019-11-20 11:21:45,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:21:45,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:45,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:21:45,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:21:45,998 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 5 states. [2019-11-20 11:21:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:46,211 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-11-20 11:21:46,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:21:46,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-20 11:21:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:46,213 INFO L225 Difference]: With dead ends: 78 [2019-11-20 11:21:46,214 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 11:21:46,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:21:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 11:21:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-11-20 11:21:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 11:21:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2019-11-20 11:21:46,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 27 [2019-11-20 11:21:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:46,225 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2019-11-20 11:21:46,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:21:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2019-11-20 11:21:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:21:46,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:46,227 INFO L410 BasicCegarLoop]: trace histogram [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-11-20 11:21:46,227 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:46,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1881014477, now seen corresponding path program 1 times [2019-11-20 11:21:46,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:46,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474197603] [2019-11-20 11:21:46,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:46,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474197603] [2019-11-20 11:21:46,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:21:46,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:21:46,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517700555] [2019-11-20 11:21:46,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:21:46,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:21:46,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:21:46,340 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 5 states. [2019-11-20 11:21:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:46,539 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-20 11:21:46,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:21:46,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-20 11:21:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:46,542 INFO L225 Difference]: With dead ends: 80 [2019-11-20 11:21:46,542 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 11:21:46,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:21:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 11:21:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2019-11-20 11:21:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 11:21:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2019-11-20 11:21:46,551 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 29 [2019-11-20 11:21:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:46,551 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2019-11-20 11:21:46,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:21:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2019-11-20 11:21:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:21:46,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:46,555 INFO L410 BasicCegarLoop]: trace histogram [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-11-20 11:21:46,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1389249843, now seen corresponding path program 1 times [2019-11-20 11:21:46,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:46,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309262596] [2019-11-20 11:21:46,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:46,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309262596] [2019-11-20 11:21:46,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:21:46,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:21:46,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831084803] [2019-11-20 11:21:46,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:21:46,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:21:46,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:21:46,629 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 5 states. [2019-11-20 11:21:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:46,772 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-20 11:21:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:21:46,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-20 11:21:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:46,774 INFO L225 Difference]: With dead ends: 80 [2019-11-20 11:21:46,774 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 11:21:46,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:21:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 11:21:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2019-11-20 11:21:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-20 11:21:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-11-20 11:21:46,781 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29 [2019-11-20 11:21:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:46,781 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-11-20 11:21:46,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:21:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-11-20 11:21:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 11:21:46,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:46,783 INFO L410 BasicCegarLoop]: trace histogram [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-11-20 11:21:46,783 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 115063225, now seen corresponding path program 1 times [2019-11-20 11:21:46,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:46,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584134882] [2019-11-20 11:21:46,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:46,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584134882] [2019-11-20 11:21:46,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408690637] [2019-11-20 11:21:46,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/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-11-20 11:21:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:47,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 11:21:47,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:47,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:47,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:47,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:21:47,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:47,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-20 11:21:47,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:47,247 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:21:47,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:47,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-20 11:21:47,292 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 11:21:47,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 11:21:47,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:47,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-20 11:21:47,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 11:21:47,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:47,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:47,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-20 11:21:47,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:21:47,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:47,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:47,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-20 11:21:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:47,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:47,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-20 11:21:47,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362951398] [2019-11-20 11:21:47,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:21:47,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:21:47,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:21:47,413 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 10 states. [2019-11-20 11:21:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:47,892 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-11-20 11:21:47,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:21:47,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-20 11:21:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:47,894 INFO L225 Difference]: With dead ends: 82 [2019-11-20 11:21:47,894 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 11:21:47,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:21:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 11:21:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-11-20 11:21:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 11:21:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-11-20 11:21:47,903 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 31 [2019-11-20 11:21:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:47,903 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-11-20 11:21:47,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:21:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-11-20 11:21:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 11:21:47,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:47,906 INFO L410 BasicCegarLoop]: trace histogram [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-11-20 11:21:48,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:48,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash 978464889, now seen corresponding path program 1 times [2019-11-20 11:21:48,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:48,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387972408] [2019-11-20 11:21:48,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:48,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387972408] [2019-11-20 11:21:48,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396434034] [2019-11-20 11:21:48,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/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-11-20 11:21:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:48,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 11:21:48,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:48,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:48,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:48,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:21:48,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:48,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-20 11:21:48,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:48,423 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:21:48,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:48,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-20 11:21:48,468 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 11:21:48,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 11:21:48,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:48,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-20 11:21:48,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 11:21:48,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:48,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:48,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-20 11:21:48,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:21:48,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:48,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:48,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-20 11:21:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:48,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:48,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-20 11:21:48,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441032041] [2019-11-20 11:21:48,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:21:48,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:48,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:21:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:21:48,594 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 10 states. [2019-11-20 11:21:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:49,057 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2019-11-20 11:21:49,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:21:49,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-20 11:21:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:49,058 INFO L225 Difference]: With dead ends: 91 [2019-11-20 11:21:49,058 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 11:21:49,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:21:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 11:21:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-20 11:21:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 11:21:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-20 11:21:49,073 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 31 [2019-11-20 11:21:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:49,074 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-20 11:21:49,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:21:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-20 11:21:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 11:21:49,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:49,077 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:21:49,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:49,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:49,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:49,278 INFO L82 PathProgramCache]: Analyzing trace with hash -20007500, now seen corresponding path program 1 times [2019-11-20 11:21:49,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:49,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288027643] [2019-11-20 11:21:49,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:21:49,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288027643] [2019-11-20 11:21:49,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001965856] [2019-11-20 11:21:49,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:49,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 11:21:49,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:49,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:49,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:21:49,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-20 11:21:49,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-20 11:21:49,787 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 11:21:49,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,809 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 11:21:49,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-20 11:21:49,858 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-11-20 11:21:49,862 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 0 case distinctions, treesize of input 29 treesize of output 19 [2019-11-20 11:21:49,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,898 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-20 11:21:49,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:21:49,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,945 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-20 11:21:49,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-20 11:21:49,951 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:49,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:49,958 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-20 11:21:49,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-20 11:21:49,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:50,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:50,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 11:21:50,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:50,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:50,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:50,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-20 11:21:50,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 11:21:50,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:50,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:50,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:50,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-20 11:21:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:50,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:50,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-20 11:21:50,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640814792] [2019-11-20 11:21:50,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 11:21:50,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:50,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 11:21:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-20 11:21:50,040 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-20 11:21:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:50,585 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2019-11-20 11:21:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:21:50,585 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-11-20 11:21:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:50,586 INFO L225 Difference]: With dead ends: 95 [2019-11-20 11:21:50,586 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 11:21:50,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-20 11:21:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 11:21:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-20 11:21:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-20 11:21:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2019-11-20 11:21:50,597 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 33 [2019-11-20 11:21:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:50,597 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2019-11-20 11:21:50,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 11:21:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2019-11-20 11:21:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 11:21:50,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:50,599 INFO L410 BasicCegarLoop]: trace histogram [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-11-20 11:21:50,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:50,803 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1998658321, now seen corresponding path program 1 times [2019-11-20 11:21:50,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:50,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504568155] [2019-11-20 11:21:50,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:21:51,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504568155] [2019-11-20 11:21:51,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104724811] [2019-11-20 11:21:51,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:51,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 11:21:51,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:51,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:51,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:21:51,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-20 11:21:51,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-20 11:21:51,274 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 11:21:51,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,300 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 11:21:51,300 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-20 11:21:51,354 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-11-20 11:21:51,364 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 0 case distinctions, treesize of input 29 treesize of output 19 [2019-11-20 11:21:51,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,414 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-20 11:21:51,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:21:51,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,439 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-20 11:21:51,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-20 11:21:51,444 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,452 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-20 11:21:51,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-20 11:21:51,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 11:21:51,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-20 11:21:51,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 11:21:51,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:51,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:51,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-20 11:21:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:51,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:51,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-20 11:21:51,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716228295] [2019-11-20 11:21:51,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 11:21:51,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 11:21:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-20 11:21:51,539 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 15 states. [2019-11-20 11:21:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:52,200 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2019-11-20 11:21:52,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:21:52,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-11-20 11:21:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:52,202 INFO L225 Difference]: With dead ends: 97 [2019-11-20 11:21:52,202 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 11:21:52,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-20 11:21:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 11:21:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-11-20 11:21:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 11:21:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2019-11-20 11:21:52,211 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2019-11-20 11:21:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:52,211 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2019-11-20 11:21:52,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 11:21:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2019-11-20 11:21:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 11:21:52,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:52,217 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 11:21:52,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:52,432 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash -973955345, now seen corresponding path program 2 times [2019-11-20 11:21:52,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:52,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910650757] [2019-11-20 11:21:52,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:21:52,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910650757] [2019-11-20 11:21:52,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703971918] [2019-11-20 11:21:52,721 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:52,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 11:21:52,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:21:52,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 11:21:52,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:52,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:52,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:52,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:21:52,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:52,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-20 11:21:52,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:52,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-20 11:21:52,863 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:21:52,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:52,880 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:21:52,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:52,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-20 11:21:52,909 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2019-11-20 11:21:52,917 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 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-20 11:21:52,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:52,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:52,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:52,964 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-11-20 11:21:52,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:21:52,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,013 INFO L567 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2019-11-20 11:21:53,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-11-20 11:21:53,017 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:53,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,024 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-20 11:21:53,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-20 11:21:53,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:53,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 11:21:53,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:53,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-20 11:21:53,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 11:21:53,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:53,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:53,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-20 11:21:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:53,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:53,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-20 11:21:53,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204588167] [2019-11-20 11:21:53,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 11:21:53,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 11:21:53,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:21:53,093 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 11 states. [2019-11-20 11:21:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:53,614 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-11-20 11:21:53,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:21:53,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-20 11:21:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:53,615 INFO L225 Difference]: With dead ends: 90 [2019-11-20 11:21:53,616 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 11:21:53,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:21:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 11:21:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2019-11-20 11:21:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 11:21:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2019-11-20 11:21:53,624 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2019-11-20 11:21:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:53,625 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2019-11-20 11:21:53,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 11:21:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2019-11-20 11:21:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 11:21:53,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:53,627 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 11:21:53,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:53,830 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1696962272, now seen corresponding path program 2 times [2019-11-20 11:21:53,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:53,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407826364] [2019-11-20 11:21:53,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:54,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407826364] [2019-11-20 11:21:54,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551230846] [2019-11-20 11:21:54,034 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:54,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 11:21:54,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:21:54,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-20 11:21:54,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:54,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:54,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:21:54,161 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 11:21:54,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,197 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-20 11:21:54,201 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:21:54,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,214 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-20 11:21:54,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:21:54,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 11:21:54,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-20 11:21:54,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-20 11:21:54,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 11:21:54,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-20 11:21:54,418 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 11:21:54,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-20 11:21:54,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:54,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-20 11:21:54,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-20 11:21:54,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:54,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:54,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:54,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-20 11:21:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:54,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:54,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-20 11:21:54,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205760244] [2019-11-20 11:21:54,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 11:21:54,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:54,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 11:21:54,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:21:54,580 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand 18 states. [2019-11-20 11:21:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:55,326 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2019-11-20 11:21:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 11:21:55,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-11-20 11:21:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:55,327 INFO L225 Difference]: With dead ends: 109 [2019-11-20 11:21:55,328 INFO L226 Difference]: Without dead ends: 101 [2019-11-20 11:21:55,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 11:21:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-20 11:21:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2019-11-20 11:21:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-20 11:21:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2019-11-20 11:21:55,334 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 35 [2019-11-20 11:21:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:55,335 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2019-11-20 11:21:55,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 11:21:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2019-11-20 11:21:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 11:21:55,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:55,336 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:21:55,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:55,540 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1996664224, now seen corresponding path program 1 times [2019-11-20 11:21:55,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:55,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150734842] [2019-11-20 11:21:55,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:55,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150734842] [2019-11-20 11:21:55,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590547995] [2019-11-20 11:21:55,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:55,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 11:21:55,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:55,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:55,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:55,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:55,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:55,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:21:55,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:55,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 11:21:55,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:55,953 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-20 11:21:55,958 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 11 treesize of output 7 [2019-11-20 11:21:55,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:55,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:55,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:55,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-11-20 11:21:56,014 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 11:21:56,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 11:21:56,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:56,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-11-20 11:21:56,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:56,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-20 11:21:56,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:56,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 11:21:56,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:56,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,086 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2019-11-20 11:21:56,126 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 11:21:56,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-20 11:21:56,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:56,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:56,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2019-11-20 11:21:56,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-20 11:21:56,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:56,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:56,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-20 11:21:56,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 11:21:56,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:56,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:56,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-20 11:21:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:56,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:56,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-20 11:21:56,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845841150] [2019-11-20 11:21:56,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 11:21:56,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 11:21:56,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-11-20 11:21:56,303 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 20 states. [2019-11-20 11:21:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:57,143 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2019-11-20 11:21:57,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 11:21:57,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-11-20 11:21:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:57,145 INFO L225 Difference]: With dead ends: 131 [2019-11-20 11:21:57,145 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 11:21:57,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 11:21:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 11:21:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2019-11-20 11:21:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-20 11:21:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-11-20 11:21:57,152 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 35 [2019-11-20 11:21:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:57,152 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-11-20 11:21:57,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 11:21:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-11-20 11:21:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 11:21:57,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:57,157 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 11:21:57,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:57,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash -233446117, now seen corresponding path program 3 times [2019-11-20 11:21:57,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:57,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878428964] [2019-11-20 11:21:57,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:21:57,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878428964] [2019-11-20 11:21:57,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008458495] [2019-11-20 11:21:57,637 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:57,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 11:21:57,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:21:57,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-20 11:21:57,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:57,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:21:57,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:57,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:21:57,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:57,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 11:21:57,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,797 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-20 11:21:57,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-20 11:21:57,840 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:21:57,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:57,873 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:21:57,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:57,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-20 11:21:57,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:57,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-20 11:21:57,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:57,950 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_53|], 2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_53|]} [2019-11-20 11:21:57,953 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 11 treesize of output 7 [2019-11-20 11:21:57,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:57,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:57,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:21:57,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 11:21:57,983 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:21:58,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-20 11:21:58,006 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,019 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:43 [2019-11-20 11:21:58,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 116 [2019-11-20 11:21:58,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:21:58,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 125 [2019-11-20 11:21:58,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:21:58,094 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,135 INFO L567 ElimStorePlain]: treesize reduction 24, result has 85.8 percent of original size [2019-11-20 11:21:58,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:21:58,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-20 11:21:58,146 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,178 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:117 [2019-11-20 11:21:58,234 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_55|], 6=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_55|]} [2019-11-20 11:21:58,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2019-11-20 11:21:58,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,294 INFO L567 ElimStorePlain]: treesize reduction 22, result has 92.4 percent of original size [2019-11-20 11:21:58,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 258 [2019-11-20 11:21:58,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2019-11-20 11:21:58,387 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,415 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-20 11:21:58,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,416 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:306, output treesize:60 [2019-11-20 11:21:58,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,514 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-11-20 11:21:58,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:21:58,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:21:58,516 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:58,550 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-20 11:21:58,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:21:58,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:21:58,564 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-20 11:21:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:21:58,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:58,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-11-20 11:21:58,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823740202] [2019-11-20 11:21:58,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 11:21:58,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:21:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 11:21:58,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-20 11:21:58,644 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 21 states. [2019-11-20 11:21:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:59,538 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2019-11-20 11:21:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 11:21:59,539 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-11-20 11:21:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:59,540 INFO L225 Difference]: With dead ends: 118 [2019-11-20 11:21:59,540 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 11:21:59,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 11:21:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 11:21:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2019-11-20 11:21:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 11:21:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-11-20 11:21:59,546 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 37 [2019-11-20 11:21:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:59,546 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-11-20 11:21:59,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 11:21:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-11-20 11:21:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 11:21:59,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:59,547 INFO L410 BasicCegarLoop]: trace histogram [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-11-20 11:21:59,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:21:59,747 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:21:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1007382053, now seen corresponding path program 1 times [2019-11-20 11:21:59,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:21:59,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594352524] [2019-11-20 11:21:59,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:21:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:21:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:21:59,837 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:21:59,837 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 11:21:59,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:21:59 BoogieIcfgContainer [2019-11-20 11:21:59,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:21:59,896 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:21:59,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:21:59,896 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:21:59,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:21:45" (3/4) ... [2019-11-20 11:21:59,899 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 11:21:59,954 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00baa3cc-2f46-4537-8f88-2a581f190d70/bin/uautomizer/witness.graphml [2019-11-20 11:21:59,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:21:59,955 INFO L168 Benchmark]: Toolchain (without parser) took 16194.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 940.7 MB in the beginning and 927.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 347.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:21:59,956 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:21:59,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:21:59,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:21:59,958 INFO L168 Benchmark]: Boogie Preprocessor took 53.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:21:59,959 INFO L168 Benchmark]: RCFGBuilder took 667.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:21:59,961 INFO L168 Benchmark]: TraceAbstraction took 14607.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 930.9 MB in the end (delta: 156.5 MB). Peak memory consumption was 335.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:21:59,961 INFO L168 Benchmark]: Witness Printer took 58.34 ms. Allocated memory is still 1.4 GB. Free memory was 930.9 MB in the beginning and 927.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:21:59,963 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 729.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 667.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14607.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 930.9 MB in the end (delta: 156.5 MB). Peak memory consumption was 335.8 MB. Max. memory is 11.5 GB. * Witness Printer took 58.34 ms. Allocated memory is still 1.4 GB. Free memory was 930.9 MB in the beginning and 927.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) [L565] COND FALSE !(\read(*root)) [L584] List a = (List) malloc(sizeof(struct node)); [L585] COND FALSE !(a == 0) [L586] List t; [L587] List p = a; [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) [L591] COND FALSE !(t == 0) [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) [L598] COND FALSE !(t == 0) [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a [L604] EXPR p->h [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.5s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 760 SDtfs, 1050 SDslu, 3392 SDs, 0 SdLazy, 2445 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 251 SyntacticMatches, 8 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 169 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 671 ConstructedInterpolants, 17 QuantifiedInterpolants, 185717 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1198 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 32/112 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...