./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/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 ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.23-635dfa2 [2018-12-02 19:22:16,781 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 19:22:16,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 19:22:16,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 19:22:16,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 19:22:16,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 19:22:16,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 19:22:16,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 19:22:16,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 19:22:16,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 19:22:16,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 19:22:16,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 19:22:16,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 19:22:16,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 19:22:16,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 19:22:16,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 19:22:16,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 19:22:16,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 19:22:16,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 19:22:16,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 19:22:16,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 19:22:16,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 19:22:16,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 19:22:16,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 19:22:16,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 19:22:16,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 19:22:16,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 19:22:16,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 19:22:16,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 19:22:16,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 19:22:16,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 19:22:16,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 19:22:16,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 19:22:16,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 19:22:16,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 19:22:16,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 19:22:16,802 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 19:22:16,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 19:22:16,809 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 19:22:16,810 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 19:22:16,810 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 19:22:16,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 19:22:16,811 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 19:22:16,811 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 19:22:16,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 19:22:16,811 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 19:22:16,811 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 19:22:16,811 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 19:22:16,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 19:22:16,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 19:22:16,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 19:22:16,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 19:22:16,812 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 19:22:16,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 19:22:16,812 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 19:22:16,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 19:22:16,812 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 19:22:16,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 19:22:16,813 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 19:22:16,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 19:22:16,814 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/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 -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-12-02 19:22:16,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 19:22:16,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 19:22:16,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 19:22:16,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 19:22:16,841 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 19:22:16,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-12-02 19:22:16,876 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/data/d6fa62270/e7c027b53e924a0fb185f037e0ceed08/FLAG99c649a64 [2018-12-02 19:22:17,257 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 19:22:17,257 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-12-02 19:22:17,262 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/data/d6fa62270/e7c027b53e924a0fb185f037e0ceed08/FLAG99c649a64 [2018-12-02 19:22:17,270 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/data/d6fa62270/e7c027b53e924a0fb185f037e0ceed08 [2018-12-02 19:22:17,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 19:22:17,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 19:22:17,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 19:22:17,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 19:22:17,275 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 19:22:17,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1441f7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17, skipping insertion in model container [2018-12-02 19:22:17,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 19:22:17,293 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 19:22:17,389 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:22:17,394 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 19:22:17,408 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:22:17,417 INFO L195 MainTranslator]: Completed translation [2018-12-02 19:22:17,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17 WrapperNode [2018-12-02 19:22:17,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 19:22:17,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 19:22:17,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 19:22:17,418 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 19:22:17,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 19:22:17,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 19:22:17,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 19:22:17,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 19:22:17,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... [2018-12-02 19:22:17,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 19:22:17,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 19:22:17,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 19:22:17,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 19:22:17,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/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 [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 19:22:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 19:22:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 19:22:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-02 19:22:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-02 19:22:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 19:22:17,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 19:22:17,702 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 19:22:17,702 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 19:22:17,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:22:17 BoogieIcfgContainer [2018-12-02 19:22:17,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 19:22:17,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 19:22:17,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 19:22:17,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 19:22:17,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:22:17" (1/3) ... [2018-12-02 19:22:17,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60329351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:22:17, skipping insertion in model container [2018-12-02 19:22:17,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:22:17" (2/3) ... [2018-12-02 19:22:17,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60329351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:22:17, skipping insertion in model container [2018-12-02 19:22:17,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:22:17" (3/3) ... [2018-12-02 19:22:17,711 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-12-02 19:22:17,723 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 19:22:17,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 19:22:17,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 19:22:17,769 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 19:22:17,769 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 19:22:17,770 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 19:22:17,770 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 19:22:17,770 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 19:22:17,770 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 19:22:17,770 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 19:22:17,770 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 19:22:17,770 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 19:22:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-02 19:22:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 19:22:17,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:17,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:17,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:17,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-12-02 19:22:17,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:17,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:17,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:22:17,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:22:17,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 19:22:17,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 19:22:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 19:22:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 19:22:17,903 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-12-02 19:22:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:17,917 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-12-02 19:22:17,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 19:22:17,918 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-12-02 19:22:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:17,924 INFO L225 Difference]: With dead ends: 42 [2018-12-02 19:22:17,925 INFO L226 Difference]: Without dead ends: 20 [2018-12-02 19:22:17,927 INFO L631 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 [2018-12-02 19:22:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-02 19:22:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 19:22:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 19:22:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-02 19:22:17,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-12-02 19:22:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:17,955 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-02 19:22:17,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 19:22:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-02 19:22:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 19:22:17,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:17,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:17,956 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:17,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-12-02 19:22:17,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:17,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:17,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:17,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:17,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:22:17,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:22:17,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 19:22:17,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:22:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:22:17,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:22:17,990 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-12-02 19:22:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:18,003 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-02 19:22:18,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:22:18,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 19:22:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:18,004 INFO L225 Difference]: With dead ends: 34 [2018-12-02 19:22:18,004 INFO L226 Difference]: Without dead ends: 22 [2018-12-02 19:22:18,005 INFO L631 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 [2018-12-02 19:22:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-02 19:22:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 19:22:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 19:22:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 19:22:18,007 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-02 19:22:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:18,007 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 19:22:18,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:22:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-02 19:22:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 19:22:18,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:18,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:18,008 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:18,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-12-02 19:22:18,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:18,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:22:18,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:18,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:18,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:22:18,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:18,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 19:22:18,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:22:18,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:22:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:22:18,121 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-12-02 19:22:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:18,141 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-02 19:22:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:22:18,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 19:22:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:18,143 INFO L225 Difference]: With dead ends: 36 [2018-12-02 19:22:18,143 INFO L226 Difference]: Without dead ends: 24 [2018-12-02 19:22:18,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:22:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-02 19:22:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 19:22:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 19:22:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 19:22:18,146 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-02 19:22:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 19:22:18,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:22:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-02 19:22:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 19:22:18,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:18,147 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:18,147 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:18,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-12-02 19:22:18,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:22:18,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:18,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:18,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 19:22:18,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 19:22:18,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:18,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:18,256 INFO L478 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 17 treesize of output 13 [2018-12-02 19:22:18,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2018-12-02 19:22:18,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 19:22:18,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:18,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:18,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 19:22:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 19:22:18,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 19:22:18,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-12-02 19:22:18,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 19:22:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 19:22:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:22:18,293 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-12-02 19:22:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:18,347 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-02 19:22:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:22:18,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-02 19:22:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:18,348 INFO L225 Difference]: With dead ends: 40 [2018-12-02 19:22:18,348 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 19:22:18,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 19:22:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 19:22:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-02 19:22:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 19:22:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-02 19:22:18,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-12-02 19:22:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:18,352 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 19:22:18,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 19:22:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-02 19:22:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 19:22:18,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:18,353 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:18,354 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:18,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 1 times [2018-12-02 19:22:18,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 19:22:18,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:18,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 19:22:18,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:18,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 19:22:18,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 19:22:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 19:22:18,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:22:18,453 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-12-02 19:22:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:18,476 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-02 19:22:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:22:18,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 19:22:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:18,477 INFO L225 Difference]: With dead ends: 44 [2018-12-02 19:22:18,477 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 19:22:18,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:22:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 19:22:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-02 19:22:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 19:22:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-02 19:22:18,480 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-02 19:22:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:18,480 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-02 19:22:18,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 19:22:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-02 19:22:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 19:22:18,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:18,481 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:18,481 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:18,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 2 times [2018-12-02 19:22:18,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:18,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:18,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 19:22:18,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:18,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 19:22:18,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 19:22:18,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:18,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 19:22:18,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:18,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 19:22:18,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 19:22:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 19:22:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:22:18,607 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2018-12-02 19:22:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:18,636 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-12-02 19:22:18,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:22:18,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-02 19:22:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:18,638 INFO L225 Difference]: With dead ends: 46 [2018-12-02 19:22:18,638 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 19:22:18,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:22:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 19:22:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-02 19:22:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 19:22:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-02 19:22:18,642 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-02 19:22:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:18,642 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-02 19:22:18,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 19:22:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-02 19:22:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 19:22:18,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:18,643 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:18,644 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:18,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash 814278768, now seen corresponding path program 3 times [2018-12-02 19:22:18,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 19:22:18,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:18,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:18,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 19:22:18,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 19:22:18,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:18,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:18,762 INFO L478 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 17 treesize of output 13 [2018-12-02 19:22:18,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2018-12-02 19:22:18,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 19:22:18,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:18,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:18,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 19:22:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 19:22:18,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-12-02 19:22:18,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 19:22:18,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 19:22:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 19:22:18,805 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-12-02 19:22:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:18,891 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-12-02 19:22:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 19:22:18,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-12-02 19:22:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:18,892 INFO L225 Difference]: With dead ends: 50 [2018-12-02 19:22:18,892 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 19:22:18,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-02 19:22:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 19:22:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-02 19:22:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 19:22:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-02 19:22:18,895 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-12-02 19:22:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:18,895 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-02 19:22:18,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 19:22:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-02 19:22:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 19:22:18,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:18,896 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:18,896 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:18,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1119042125, now seen corresponding path program 4 times [2018-12-02 19:22:18,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:18,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 19:22:18,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:18,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 19:22:18,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 19:22:18,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:18,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:19,032 INFO L478 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 17 treesize of output 13 [2018-12-02 19:22:19,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2018-12-02 19:22:19,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 19:22:19,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:19,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:19,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 19:22:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 19:22:19,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:19,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-12-02 19:22:19,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 19:22:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 19:22:19,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 19:22:19,061 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2018-12-02 19:22:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:19,139 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-12-02 19:22:19,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 19:22:19,140 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-12-02 19:22:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:19,140 INFO L225 Difference]: With dead ends: 56 [2018-12-02 19:22:19,140 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 19:22:19,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-12-02 19:22:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 19:22:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-12-02 19:22:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 19:22:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-02 19:22:19,144 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-12-02 19:22:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:19,145 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-02 19:22:19,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 19:22:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-02 19:22:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 19:22:19,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:19,146 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:19,146 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:19,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 5 times [2018-12-02 19:22:19,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:19,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:19,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:19,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:19,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 19:22:19,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:19,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 19:22:20,738 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-02 19:22:20,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:20,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 19:22:20,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:20,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-02 19:22:20,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 19:22:20,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 19:22:20,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 19:22:20,766 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-12-02 19:22:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:20,791 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-02 19:22:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 19:22:20,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-02 19:22:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:20,792 INFO L225 Difference]: With dead ends: 60 [2018-12-02 19:22:20,792 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 19:22:20,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 19:22:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 19:22:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-02 19:22:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 19:22:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-02 19:22:20,795 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-02 19:22:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:20,795 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-02 19:22:20,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 19:22:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-02 19:22:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 19:22:20,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:20,796 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:20,796 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:20,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 478163660, now seen corresponding path program 6 times [2018-12-02 19:22:20,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:20,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:20,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:20,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:20,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 19:22:20,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:20,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:20,887 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 19:22:21,462 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-02 19:22:21,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:21,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:21,513 INFO L478 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 17 treesize of output 13 [2018-12-02 19:22:21,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2018-12-02 19:22:21,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 19:22:21,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:21,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:21,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 19:22:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 19:22:21,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:21,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-12-02 19:22:21,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 19:22:21,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 19:22:21,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-12-02 19:22:21,540 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2018-12-02 19:22:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:21,625 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-02 19:22:21,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 19:22:21,625 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-02 19:22:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:21,625 INFO L225 Difference]: With dead ends: 64 [2018-12-02 19:22:21,625 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 19:22:21,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-12-02 19:22:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 19:22:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-02 19:22:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 19:22:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-02 19:22:21,629 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-12-02 19:22:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:21,629 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-02 19:22:21,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 19:22:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-02 19:22:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 19:22:21,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:21,630 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:21,630 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:21,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash -956118231, now seen corresponding path program 7 times [2018-12-02 19:22:21,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:21,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:21,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:21,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:21,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 19:22:21,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:21,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:21,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:21,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 19:22:21,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:21,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 19:22:21,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 19:22:21,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 19:22:21,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 19:22:21,750 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 13 states. [2018-12-02 19:22:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:21,778 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-02 19:22:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 19:22:21,778 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-02 19:22:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:21,779 INFO L225 Difference]: With dead ends: 67 [2018-12-02 19:22:21,779 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 19:22:21,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 19:22:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 19:22:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-02 19:22:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 19:22:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-02 19:22:21,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-02 19:22:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:21,783 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-02 19:22:21,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 19:22:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-02 19:22:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 19:22:21,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:21,784 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:21,784 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:21,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash -50051957, now seen corresponding path program 8 times [2018-12-02 19:22:21,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:21,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:21,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:21,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:22:21,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 19:22:22,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:22,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:22,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 19:22:22,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 19:22:22,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:22,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:22,439 INFO L478 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 25 treesize of output 21 [2018-12-02 19:22:22,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-12-02 19:22:22,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 19:22:22,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:22,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:22,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-12-02 19:22:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 19:22:22,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:22,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 26 [2018-12-02 19:22:22,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 19:22:22,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 19:22:22,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2018-12-02 19:22:22,465 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 26 states. [2018-12-02 19:22:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:22,868 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-02 19:22:22,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 19:22:22,868 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-12-02 19:22:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:22,869 INFO L225 Difference]: With dead ends: 57 [2018-12-02 19:22:22,869 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 19:22:22,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 19:22:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 19:22:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-02 19:22:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 19:22:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-02 19:22:22,872 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-02 19:22:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:22,872 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-02 19:22:22,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 19:22:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-02 19:22:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 19:22:22,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:22,873 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:22,873 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:22,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -715849914, now seen corresponding path program 9 times [2018-12-02 19:22:22,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:22,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:22,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:22,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:22,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:22:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 19:22:23,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:22:23,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 19:22:23,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 19:22:23,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 19:22:23,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 19:22:23,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 19:22:23,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 19:22:23,777 INFO L478 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 12 treesize of output 1 [2018-12-02 19:22:23,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 19:22:23,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:23,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:23,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2018-12-02 19:22:23,833 INFO L478 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 17 treesize of output 13 [2018-12-02 19:22:23,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2018-12-02 19:22:23,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 19:22:23,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:23,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 19:22:23,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 19:22:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 19:22:23,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 19:22:23,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2018-12-02 19:22:23,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 19:22:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 19:22:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-12-02 19:22:23,860 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-12-02 19:22:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:22:24,065 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-12-02 19:22:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 19:22:24,065 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-12-02 19:22:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:22:24,066 INFO L225 Difference]: With dead ends: 67 [2018-12-02 19:22:24,066 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 19:22:24,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=504, Invalid=1218, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 19:22:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 19:22:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 19:22:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 19:22:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-02 19:22:24,070 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 48 [2018-12-02 19:22:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:22:24,070 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-02 19:22:24,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 19:22:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-02 19:22:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 19:22:24,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:22:24,071 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:22:24,071 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:22:24,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:22:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash -875693139, now seen corresponding path program 10 times [2018-12-02 19:22:24,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 19:22:24,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 19:22:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:24,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:22:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:22:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 19:22:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 19:22:24,201 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 19:22:24,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:22:24 BoogieIcfgContainer [2018-12-02 19:22:24,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 19:22:24,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 19:22:24,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 19:22:24,231 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 19:22:24,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:22:17" (3/4) ... [2018-12-02 19:22:24,234 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 19:22:24,280 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b2badef3-f4d9-4ce1-85c3-0417f1571c18/bin-2019/uautomizer/witness.graphml [2018-12-02 19:22:24,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 19:22:24,281 INFO L168 Benchmark]: Toolchain (without parser) took 7009.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 953.3 MB in the beginning and 903.6 MB in the end (delta: 49.7 MB). Peak memory consumption was 217.5 MB. Max. memory is 11.5 GB. [2018-12-02 19:22:24,282 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 19:22:24,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.39 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-02 19:22:24,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.09 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 19:22:24,283 INFO L168 Benchmark]: Boogie Preprocessor took 47.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 19:22:24,283 INFO L168 Benchmark]: RCFGBuilder took 223.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 19:22:24,283 INFO L168 Benchmark]: TraceAbstraction took 6527.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 908.8 MB in the end (delta: 191.6 MB). Peak memory consumption was 239.9 MB. Max. memory is 11.5 GB. [2018-12-02 19:22:24,284 INFO L168 Benchmark]: Witness Printer took 49.16 ms. Allocated memory is still 1.2 GB. Free memory was 908.8 MB in the beginning and 903.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-12-02 19:22:24,285 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.39 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.09 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6527.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 908.8 MB in the end (delta: 191.6 MB). Peak memory consumption was 239.9 MB. Max. memory is 11.5 GB. * Witness Printer took 49.16 ms. Allocated memory is still 1.2 GB. Free memory was 908.8 MB in the beginning and 903.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=0, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=0, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:0}, cont.array[0].b=5, i=0, j=10, pa={106:4}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=0, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=1, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=2, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=2, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=3, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=3, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=4, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=4, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=5, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=5, j=10, pa={106:4}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 6.4s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 237 SDtfs, 124 SDslu, 1026 SDs, 0 SdLazy, 817 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 363 SyntacticMatches, 10 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 845 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 763 ConstructedInterpolants, 9 QuantifiedInterpolants, 78041 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1701 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 386/1182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...