./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0c6762a510921214435f03fd1512220ceb2c5e3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0c6762a510921214435f03fd1512220ceb2c5e3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:32:55,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:32:55,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:32:55,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:32:55,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:32:55,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:32:55,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:32:55,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:32:55,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:32:55,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:32:55,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:32:55,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:32:55,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:32:55,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:32:55,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:32:55,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:32:55,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:32:55,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:32:55,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:32:55,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:32:55,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:32:55,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:32:55,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:32:55,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:32:55,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:32:55,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:32:55,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:32:55,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:32:55,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:32:55,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:32:55,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:32:55,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:32:55,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:32:55,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:32:55,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:32:55,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:32:55,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:32:55,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:32:55,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:32:55,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:32:55,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:32:55,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:32:55,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:32:55,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:32:55,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:32:55,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:32:55,878 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:32:55,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:32:55,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:32:55,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:32:55,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:32:55,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:32:55,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:32:55,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:32:55,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:32:55,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:32:55,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:32:55,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:32:55,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:32:55,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:32:55,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:32:55,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:32:55,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:32:55,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0c6762a510921214435f03fd1512220ceb2c5e3 [2019-12-07 17:32:55,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:32:55,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:32:55,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:32:55,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:32:55,998 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:32:55,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s4if.c [2019-12-07 17:32:56,038 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/804e05e1b/a214feae511441ce906314b67f276254/FLAGa38c07b9b [2019-12-07 17:32:56,390 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:32:56,390 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/sv-benchmarks/c/array-fpi/s4if.c [2019-12-07 17:32:56,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/804e05e1b/a214feae511441ce906314b67f276254/FLAGa38c07b9b [2019-12-07 17:32:56,404 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/804e05e1b/a214feae511441ce906314b67f276254 [2019-12-07 17:32:56,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:32:56,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:32:56,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:32:56,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:32:56,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:32:56,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492f2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56, skipping insertion in model container [2019-12-07 17:32:56,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:32:56,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:32:56,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:32:56,587 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:32:56,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:32:56,611 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:32:56,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56 WrapperNode [2019-12-07 17:32:56,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:32:56,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:32:56,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:32:56,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:32:56,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:32:56,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:32:56,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:32:56,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:32:56,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... [2019-12-07 17:32:56,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:32:56,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:32:56,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:32:56,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:32:56,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:32:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:32:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:32:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:32:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:32:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:32:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:32:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:32:56,823 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:32:56,823 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:32:56,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:32:56 BoogieIcfgContainer [2019-12-07 17:32:56,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:32:56,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:32:56,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:32:56,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:32:56,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:32:56" (1/3) ... [2019-12-07 17:32:56,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6508a8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:32:56, skipping insertion in model container [2019-12-07 17:32:56,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:56" (2/3) ... [2019-12-07 17:32:56,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6508a8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:32:56, skipping insertion in model container [2019-12-07 17:32:56,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:32:56" (3/3) ... [2019-12-07 17:32:56,829 INFO L109 eAbstractionObserver]: Analyzing ICFG s4if.c [2019-12-07 17:32:56,835 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:32:56,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:32:56,846 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:32:56,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:32:56,861 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:32:56,861 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:32:56,861 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:32:56,861 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:32:56,861 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:32:56,861 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:32:56,861 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:32:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-12-07 17:32:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:32:56,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:56,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:56,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:32:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-12-07 17:32:56,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:56,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773959617] [2019-12-07 17:32:56,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:56,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773959617] [2019-12-07 17:32:56,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:56,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:32:56,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258515273] [2019-12-07 17:32:56,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:32:56,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:56,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:32:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:32:56,987 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-12-07 17:32:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:56,998 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-12-07 17:32:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:32:56,999 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-12-07 17:32:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:57,005 INFO L225 Difference]: With dead ends: 29 [2019-12-07 17:32:57,005 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 17:32:57,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:32:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 17:32:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 17:32:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 17:32:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-12-07 17:32:57,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-12-07 17:32:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:57,028 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-12-07 17:32:57,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:32:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-12-07 17:32:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:32:57,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:57,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:57,029 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:32:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-12-07 17:32:57,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:57,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81066803] [2019-12-07 17:32:57,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:57,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81066803] [2019-12-07 17:32:57,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:57,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:32:57,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694251738] [2019-12-07 17:32:57,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:32:57,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:57,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:32:57,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:32:57,074 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 3 states. [2019-12-07 17:32:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:57,099 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-12-07 17:32:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:32:57,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:32:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:57,100 INFO L225 Difference]: With dead ends: 23 [2019-12-07 17:32:57,100 INFO L226 Difference]: Without dead ends: 15 [2019-12-07 17:32:57,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:32:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-12-07 17:32:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-12-07 17:32:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 17:32:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-12-07 17:32:57,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-12-07 17:32:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:57,104 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-12-07 17:32:57,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:32:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-12-07 17:32:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:32:57,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:57,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:57,105 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:32:57,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-12-07 17:32:57,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:57,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646145951] [2019-12-07 17:32:57,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:32:57,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646145951] [2019-12-07 17:32:57,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:57,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:32:57,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739328020] [2019-12-07 17:32:57,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:32:57,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:32:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:32:57,150 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-12-07 17:32:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:57,179 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-12-07 17:32:57,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:32:57,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:32:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:57,180 INFO L225 Difference]: With dead ends: 22 [2019-12-07 17:32:57,180 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 17:32:57,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:32:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 17:32:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-12-07 17:32:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 17:32:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-12-07 17:32:57,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2019-12-07 17:32:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:57,183 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-12-07 17:32:57,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:32:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-12-07 17:32:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:32:57,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:57,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:57,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:32:57,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-12-07 17:32:57,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:57,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163171368] [2019-12-07 17:32:57,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:57,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163171368] [2019-12-07 17:32:57,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355219982] [2019-12-07 17:32:57,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:57,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 17:32:57,457 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:57,494 INFO L377 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 10 treesize of output 8 [2019-12-07 17:32:57,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:57,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:57,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:32:57,509 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:57,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:57,516 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:32:57,516 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 17:32:57,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:32:57,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:57,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:57,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:32:57,555 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 17:32:57,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:57,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2019-12-07 17:32:57,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:57,706 INFO L614 ElimStorePlain]: treesize reduction 32, result has 62.4 percent of original size [2019-12-07 17:32:57,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:32:57,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:53 [2019-12-07 17:32:57,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:57,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:32:57,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-12-07 17:32:57,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017768536] [2019-12-07 17:32:57,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:32:57,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:32:57,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:32:57,770 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 18 states. [2019-12-07 17:32:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:58,183 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-12-07 17:32:58,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:32:58,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-12-07 17:32:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:58,186 INFO L225 Difference]: With dead ends: 33 [2019-12-07 17:32:58,186 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 17:32:58,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:32:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 17:32:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-12-07 17:32:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 17:32:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-12-07 17:32:58,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2019-12-07 17:32:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:58,193 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-12-07 17:32:58,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:32:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-12-07 17:32:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:32:58,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:58,194 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:58,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:58,396 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:32:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash -472130976, now seen corresponding path program 2 times [2019-12-07 17:32:58,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:58,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189888274] [2019-12-07 17:32:58,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:58,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189888274] [2019-12-07 17:32:58,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082009719] [2019-12-07 17:32:58,547 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:58,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:32:58,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:32:58,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:32:58,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:58,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:32:58,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-12-07 17:32:58,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247542760] [2019-12-07 17:32:58,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:32:58,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:32:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:32:58,622 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2019-12-07 17:32:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:58,706 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-12-07 17:32:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:32:58,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-12-07 17:32:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:58,707 INFO L225 Difference]: With dead ends: 31 [2019-12-07 17:32:58,708 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 17:32:58,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:32:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 17:32:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-12-07 17:32:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 17:32:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-12-07 17:32:58,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2019-12-07 17:32:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:58,713 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-12-07 17:32:58,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:32:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-12-07 17:32:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:32:58,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:58,715 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:58,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:58,916 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:32:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1317941731, now seen corresponding path program 3 times [2019-12-07 17:32:58,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:58,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065889153] [2019-12-07 17:32:58,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:58,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065889153] [2019-12-07 17:32:58,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299702736] [2019-12-07 17:32:58,990 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:59,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 17:32:59,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:32:59,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:32:59,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:59,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:32:59,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-12-07 17:32:59,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628928148] [2019-12-07 17:32:59,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:32:59,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:59,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:32:59,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:32:59,039 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2019-12-07 17:32:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:59,099 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-12-07 17:32:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:32:59,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 17:32:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:59,100 INFO L225 Difference]: With dead ends: 35 [2019-12-07 17:32:59,100 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 17:32:59,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:32:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 17:32:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-12-07 17:32:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 17:32:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 17:32:59,104 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2019-12-07 17:32:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:59,104 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 17:32:59,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:32:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 17:32:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:32:59,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:59,105 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:59,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:59,306 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:32:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1991965825, now seen corresponding path program 4 times [2019-12-07 17:32:59,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:59,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881794115] [2019-12-07 17:32:59,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:59,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881794115] [2019-12-07 17:32:59,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158831655] [2019-12-07 17:32:59,765 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:59,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:32:59,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:32:59,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 17:32:59,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:59,796 INFO L377 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 10 treesize of output 8 [2019-12-07 17:32:59,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:59,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:59,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:32:59,804 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:59,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:59,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:32:59,808 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 17:32:59,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:32:59,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:59,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:59,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:32:59,837 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:32:59,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:59,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-12-07 17:32:59,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:59,921 INFO L614 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-12-07 17:32:59,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:32:59,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-12-07 17:33:00,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:00,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 103 [2019-12-07 17:33:00,154 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:00,180 INFO L614 ElimStorePlain]: treesize reduction 48, result has 59.0 percent of original size [2019-12-07 17:33:00,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:00,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2019-12-07 17:33:00,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:00,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 165 [2019-12-07 17:33:00,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:00,385 INFO L614 ElimStorePlain]: treesize reduction 150, result has 27.9 percent of original size [2019-12-07 17:33:00,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:00,386 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:113, output treesize:50 [2019-12-07 17:33:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:33:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:00,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:00,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-12-07 17:33:00,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937487596] [2019-12-07 17:33:00,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 17:33:00,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 17:33:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:33:00,461 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 27 states. [2019-12-07 17:33:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:01,356 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-12-07 17:33:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:33:01,356 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 19 [2019-12-07 17:33:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:01,357 INFO L225 Difference]: With dead ends: 43 [2019-12-07 17:33:01,357 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 17:33:01,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:33:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 17:33:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-12-07 17:33:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 17:33:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 17:33:01,361 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-12-07 17:33:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:01,362 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 17:33:01,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 17:33:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 17:33:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:33:01,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:01,362 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:01,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:01,564 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:01,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1189058463, now seen corresponding path program 5 times [2019-12-07 17:33:01,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:01,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555828685] [2019-12-07 17:33:01,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:01,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555828685] [2019-12-07 17:33:01,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984429084] [2019-12-07 17:33:01,644 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:01,676 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-07 17:33:01,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:33:01,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:33:01,678 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:01,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:01,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-12-07 17:33:01,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871891125] [2019-12-07 17:33:01,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:33:01,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:01,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:33:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:33:01,716 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 13 states. [2019-12-07 17:33:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:01,853 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-12-07 17:33:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:33:01,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-07 17:33:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:01,855 INFO L225 Difference]: With dead ends: 39 [2019-12-07 17:33:01,855 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 17:33:01,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:33:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 17:33:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-12-07 17:33:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 17:33:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-12-07 17:33:01,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-12-07 17:33:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:01,861 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-12-07 17:33:01,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:33:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-12-07 17:33:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:33:01,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:01,862 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:02,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:02,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:02,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:02,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1846717952, now seen corresponding path program 6 times [2019-12-07 17:33:02,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:02,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93431517] [2019-12-07 17:33:02,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:02,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93431517] [2019-12-07 17:33:02,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60519636] [2019-12-07 17:33:02,147 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:02,175 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-07 17:33:02,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:33:02,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:33:02,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:02,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:02,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-12-07 17:33:02,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510232373] [2019-12-07 17:33:02,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:33:02,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:02,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:33:02,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:33:02,216 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 13 states. [2019-12-07 17:33:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:02,280 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-12-07 17:33:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:33:02,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-12-07 17:33:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:02,281 INFO L225 Difference]: With dead ends: 43 [2019-12-07 17:33:02,281 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 17:33:02,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:33:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 17:33:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-12-07 17:33:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 17:33:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-12-07 17:33:02,284 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2019-12-07 17:33:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:02,284 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-12-07 17:33:02,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:33:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-12-07 17:33:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:33:02,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:02,285 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:02,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:02,486 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1106368034, now seen corresponding path program 7 times [2019-12-07 17:33:02,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:02,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614862929] [2019-12-07 17:33:02,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:03,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614862929] [2019-12-07 17:33:03,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611415282] [2019-12-07 17:33:03,137 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:03,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 17:33:03,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:03,199 INFO L377 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 10 treesize of output 8 [2019-12-07 17:33:03,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:03,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:03,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:33:03,212 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:03,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:03,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:03,220 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 17:33:03,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:33:03,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:03,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:03,271 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:03,271 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:33:03,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:03,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-12-07 17:33:03,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:03,585 INFO L614 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-12-07 17:33:03,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:03,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 17:33:03,970 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 17:33:03,971 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 17:33:03,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 98 [2019-12-07 17:33:03,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:04,101 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-07 17:33:04,102 INFO L614 ElimStorePlain]: treesize reduction 54, result has 47.1 percent of original size [2019-12-07 17:33:04,102 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:04,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-12-07 17:33:04,807 INFO L343 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-12-07 17:33:04,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 101 [2019-12-07 17:33:04,809 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:04,852 INFO L614 ElimStorePlain]: treesize reduction 58, result has 50.0 percent of original size [2019-12-07 17:33:04,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:04,853 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:58 [2019-12-07 17:33:04,987 INFO L343 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-12-07 17:33:04,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 101 [2019-12-07 17:33:04,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:05,009 INFO L614 ElimStorePlain]: treesize reduction 16, result has 77.1 percent of original size [2019-12-07 17:33:05,009 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:05,009 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:54 [2019-12-07 17:33:07,050 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 17:33:09,099 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 17:33:09,150 INFO L343 Elim1Store]: treesize reduction 32, result has 75.2 percent of original size [2019-12-07 17:33:09,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 171 [2019-12-07 17:33:09,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:09,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:09,163 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:09,163 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:65 [2019-12-07 17:33:09,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:33:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:09,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:09,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-12-07 17:33:09,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260780123] [2019-12-07 17:33:09,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 17:33:09,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:09,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 17:33:09,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 17:33:09,254 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 35 states. [2019-12-07 17:33:13,937 WARN L192 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-07 17:33:14,791 WARN L192 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-07 17:33:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:14,935 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2019-12-07 17:33:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:33:14,936 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-12-07 17:33:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:14,936 INFO L225 Difference]: With dead ends: 60 [2019-12-07 17:33:14,936 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 17:33:14,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=247, Invalid=2302, Unknown=1, NotChecked=0, Total=2550 [2019-12-07 17:33:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 17:33:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-12-07 17:33:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 17:33:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-12-07 17:33:14,941 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2019-12-07 17:33:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:14,942 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-12-07 17:33:14,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 17:33:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-12-07 17:33:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:33:14,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:14,942 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:15,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:15,143 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash -426309664, now seen corresponding path program 1 times [2019-12-07 17:33:15,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:15,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914209493] [2019-12-07 17:33:15,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:15,152 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 17:33:15,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670510424] [2019-12-07 17:33:15,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:15,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 17:33:15,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:15,183 INFO L377 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 10 treesize of output 8 [2019-12-07 17:33:15,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:15,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 17:33:15,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 17:33:15,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:15,206 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 17:33:15,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:15,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-07 17:33:15,228 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,241 INFO L614 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-12-07 17:33:15,241 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:15,241 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-12-07 17:33:15,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:15,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-12-07 17:33:15,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,299 INFO L614 ElimStorePlain]: treesize reduction 76, result has 29.0 percent of original size [2019-12-07 17:33:15,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:15,299 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:27 [2019-12-07 17:33:15,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:15,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-12-07 17:33:15,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:15,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:15,332 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-12-07 17:33:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:33:15,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914209493] [2019-12-07 17:33:15,341 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 17:33:15,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670510424] [2019-12-07 17:33:15,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:33:15,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-12-07 17:33:15,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063881795] [2019-12-07 17:33:15,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:33:15,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:33:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:33:15,343 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 11 states. [2019-12-07 17:33:15,538 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-12-07 17:33:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:15,670 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-12-07 17:33:15,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:33:15,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-07 17:33:15,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:15,670 INFO L225 Difference]: With dead ends: 46 [2019-12-07 17:33:15,670 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 17:33:15,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:33:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 17:33:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-12-07 17:33:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 17:33:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-12-07 17:33:15,675 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2019-12-07 17:33:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:15,675 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-12-07 17:33:15,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:33:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-12-07 17:33:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:33:15,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:15,676 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:15,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:15,877 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:15,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1700299324, now seen corresponding path program 8 times [2019-12-07 17:33:15,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:15,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670450023] [2019-12-07 17:33:15,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:15,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670450023] [2019-12-07 17:33:15,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825499769] [2019-12-07 17:33:15,939 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:15,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:33:15,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:33:15,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:33:15,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:16,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:16,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-12-07 17:33:16,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261143058] [2019-12-07 17:33:16,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:33:16,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:16,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:33:16,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:33:16,007 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 16 states. [2019-12-07 17:33:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:16,189 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-12-07 17:33:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:33:16,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-12-07 17:33:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:16,190 INFO L225 Difference]: With dead ends: 47 [2019-12-07 17:33:16,190 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 17:33:16,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:33:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 17:33:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-12-07 17:33:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 17:33:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-12-07 17:33:16,194 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 26 [2019-12-07 17:33:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:16,195 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-12-07 17:33:16,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:33:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-12-07 17:33:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:33:16,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:16,195 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:16,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:16,396 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1307941697, now seen corresponding path program 9 times [2019-12-07 17:33:16,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:16,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923852613] [2019-12-07 17:33:16,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:16,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923852613] [2019-12-07 17:33:16,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310424592] [2019-12-07 17:33:16,449 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:16,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 17:33:16,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:33:16,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:33:16,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:16,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:16,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-12-07 17:33:16,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640914225] [2019-12-07 17:33:16,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:33:16,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:16,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:33:16,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:33:16,518 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 16 states. [2019-12-07 17:33:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:16,612 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-12-07 17:33:16,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:33:16,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-07 17:33:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:16,613 INFO L225 Difference]: With dead ends: 51 [2019-12-07 17:33:16,613 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 17:33:16,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:33:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 17:33:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-12-07 17:33:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 17:33:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-12-07 17:33:16,618 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2019-12-07 17:33:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:16,619 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-12-07 17:33:16,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:33:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-12-07 17:33:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:33:16,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:16,619 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:16,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:16,820 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:16,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash 311885347, now seen corresponding path program 10 times [2019-12-07 17:33:16,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:16,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376095267] [2019-12-07 17:33:16,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:17,348 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-07 17:33:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:17,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376095267] [2019-12-07 17:33:17,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969284793] [2019-12-07 17:33:17,677 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:17,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:33:17,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:33:17,742 WARN L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 17:33:17,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:17,751 INFO L377 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 10 treesize of output 8 [2019-12-07 17:33:17,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:17,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:17,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:33:17,765 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:17,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:17,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:17,772 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 17:33:17,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:33:17,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:17,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:17,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:17,864 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:33:18,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:18,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-12-07 17:33:18,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:18,062 INFO L614 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-12-07 17:33:18,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:18,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-12-07 17:33:18,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:18,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-12-07 17:33:18,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:18,256 INFO L614 ElimStorePlain]: treesize reduction 72, result has 45.9 percent of original size [2019-12-07 17:33:18,256 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:18,257 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-12-07 17:33:18,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:18,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-12-07 17:33:18,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:18,457 INFO L614 ElimStorePlain]: treesize reduction 108, result has 41.6 percent of original size [2019-12-07 17:33:18,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:18,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-12-07 17:33:18,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:18,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 243 [2019-12-07 17:33:18,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:18,970 INFO L614 ElimStorePlain]: treesize reduction 176, result has 34.6 percent of original size [2019-12-07 17:33:18,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:18,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:118, output treesize:93 [2019-12-07 17:33:19,244 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 17:33:19,384 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:19,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 337 [2019-12-07 17:33:19,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:19,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:19,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:19,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:134, output treesize:109 [2019-12-07 17:33:19,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:19,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 110 treesize of output 447 [2019-12-07 17:33:19,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:19,866 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 67 [2019-12-07 17:33:19,866 INFO L614 ElimStorePlain]: treesize reduction 560, result has 19.4 percent of original size [2019-12-07 17:33:19,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:19,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:150, output treesize:135 [2019-12-07 17:33:20,390 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-12-07 17:33:20,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:20,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 131 treesize of output 575 [2019-12-07 17:33:20,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:20,511 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 62 [2019-12-07 17:33:20,511 INFO L614 ElimStorePlain]: treesize reduction 812, result has 12.8 percent of original size [2019-12-07 17:33:20,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:20,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:179, output treesize:104 [2019-12-07 17:33:20,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:33:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:20,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:20,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-12-07 17:33:20,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143253077] [2019-12-07 17:33:20,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 17:33:20,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 17:33:20,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2011, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 17:33:20,770 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 47 states. [2019-12-07 17:33:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:23,923 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-12-07 17:33:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 17:33:23,924 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 29 [2019-12-07 17:33:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:23,924 INFO L225 Difference]: With dead ends: 65 [2019-12-07 17:33:23,924 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 17:33:23,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=374, Invalid=4318, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 17:33:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 17:33:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-12-07 17:33:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 17:33:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-12-07 17:33:23,932 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2019-12-07 17:33:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:23,932 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-12-07 17:33:23,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 17:33:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-12-07 17:33:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:33:23,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:23,933 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:24,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:24,135 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 879440005, now seen corresponding path program 11 times [2019-12-07 17:33:24,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:24,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624686180] [2019-12-07 17:33:24,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:24,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624686180] [2019-12-07 17:33:24,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840120805] [2019-12-07 17:33:24,218 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:24,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 17:33:24,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:33:24,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:33:24,266 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:24,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:24,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-12-07 17:33:24,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499032012] [2019-12-07 17:33:24,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:33:24,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:33:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:33:24,314 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 19 states. [2019-12-07 17:33:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:24,541 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-12-07 17:33:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:33:24,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-07 17:33:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:24,542 INFO L225 Difference]: With dead ends: 55 [2019-12-07 17:33:24,542 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 17:33:24,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:33:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 17:33:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-12-07 17:33:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 17:33:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-12-07 17:33:24,550 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 31 [2019-12-07 17:33:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:24,551 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-12-07 17:33:24,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:33:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-12-07 17:33:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:33:24,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:24,552 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:24,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:24,755 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1393842980, now seen corresponding path program 12 times [2019-12-07 17:33:24,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:24,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315962985] [2019-12-07 17:33:24,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:24,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315962985] [2019-12-07 17:33:24,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73114160] [2019-12-07 17:33:24,864 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:24,903 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-07 17:33:24,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:33:24,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:33:24,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:24,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:24,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-12-07 17:33:24,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294316735] [2019-12-07 17:33:24,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:33:24,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:24,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:33:24,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:33:24,957 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 19 states. [2019-12-07 17:33:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:25,073 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-12-07 17:33:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:33:25,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-12-07 17:33:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:25,074 INFO L225 Difference]: With dead ends: 59 [2019-12-07 17:33:25,074 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 17:33:25,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:33:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 17:33:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-12-07 17:33:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 17:33:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-12-07 17:33:25,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2019-12-07 17:33:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:25,078 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-12-07 17:33:25,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:33:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-12-07 17:33:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:33:25,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:25,079 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:25,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:25,280 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:33:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1635696442, now seen corresponding path program 13 times [2019-12-07 17:33:25,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:25,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018046857] [2019-12-07 17:33:25,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:25,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018046857] [2019-12-07 17:33:25,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537893672] [2019-12-07 17:33:25,965 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:33:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:25,992 WARN L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 17:33:25,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:33:26,000 INFO L377 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 10 treesize of output 8 [2019-12-07 17:33:26,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:26,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:33:26,012 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:26,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,018 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 17:33:26,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:33:26,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:26,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:33:26,137 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-12-07 17:33:26,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2019-12-07 17:33:26,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:33:26,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-12-07 17:33:26,244 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 17:33:26,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 98 [2019-12-07 17:33:26,245 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,268 INFO L614 ElimStorePlain]: treesize reduction 54, result has 45.5 percent of original size [2019-12-07 17:33:26,269 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,269 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-12-07 17:33:26,638 INFO L343 Elim1Store]: treesize reduction 32, result has 77.5 percent of original size [2019-12-07 17:33:26,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 140 [2019-12-07 17:33:26,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,670 INFO L614 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size [2019-12-07 17:33:26,671 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,671 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-12-07 17:33:26,818 INFO L343 Elim1Store]: treesize reduction 114, result has 51.7 percent of original size [2019-12-07 17:33:26,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 155 [2019-12-07 17:33:26,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,858 INFO L614 ElimStorePlain]: treesize reduction 84, result has 45.1 percent of original size [2019-12-07 17:33:26,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:33:26,858 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2019-12-07 17:33:27,124 INFO L343 Elim1Store]: treesize reduction 112, result has 38.1 percent of original size [2019-12-07 17:33:27,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 153 [2019-12-07 17:33:27,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:27,154 INFO L614 ElimStorePlain]: treesize reduction 60, result has 54.5 percent of original size [2019-12-07 17:33:27,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:27,155 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:72 [2019-12-07 17:33:27,776 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 17:33:28,261 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 17:33:28,370 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-12-07 17:33:28,370 INFO L343 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-12-07 17:33:28,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 251 [2019-12-07 17:33:28,371 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:28,417 INFO L614 ElimStorePlain]: treesize reduction 230, result has 26.5 percent of original size [2019-12-07 17:33:28,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:28,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:83 [2019-12-07 17:33:32,407 WARN L192 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 17:33:33,229 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 17:33:33,318 INFO L343 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-12-07 17:33:33,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 251 [2019-12-07 17:33:33,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:33,365 INFO L614 ElimStorePlain]: treesize reduction 224, result has 28.4 percent of original size [2019-12-07 17:33:33,365 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:33,366 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:89 [2019-12-07 17:33:34,626 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-07 17:33:35,269 WARN L192 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 17:33:35,354 INFO L343 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-12-07 17:33:35,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 251 [2019-12-07 17:33:35,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:35,394 INFO L614 ElimStorePlain]: treesize reduction 112, result has 42.6 percent of original size [2019-12-07 17:33:35,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:35,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:83 [2019-12-07 17:33:38,239 WARN L192 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 17:33:40,346 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 17:33:40,446 INFO L343 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-12-07 17:33:40,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 251 [2019-12-07 17:33:40,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:33:40,491 INFO L614 ElimStorePlain]: treesize reduction 172, result has 34.1 percent of original size [2019-12-07 17:33:40,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:33:40,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:108, output treesize:89 [2019-12-07 17:33:40,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:33:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:33:40,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:33:40,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2019-12-07 17:33:40,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591353271] [2019-12-07 17:33:40,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 17:33:40,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 17:33:40,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2392, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 17:33:40,621 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 51 states. [2019-12-07 17:33:41,475 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-12-07 17:33:43,464 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-12-07 17:33:45,698 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-07 17:33:48,110 WARN L192 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 17:33:52,610 WARN L192 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-07 17:33:54,665 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-12-07 17:33:55,795 WARN L192 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-12-07 17:33:58,610 WARN L192 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-07 17:33:59,654 WARN L192 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-07 17:34:00,562 WARN L192 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-07 17:34:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:00,771 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-12-07 17:34:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 17:34:00,771 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 34 [2019-12-07 17:34:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:00,771 INFO L225 Difference]: With dead ends: 84 [2019-12-07 17:34:00,771 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 17:34:00,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=363, Invalid=5187, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 17:34:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 17:34:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2019-12-07 17:34:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 17:34:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-12-07 17:34:00,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 34 [2019-12-07 17:34:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:00,778 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-12-07 17:34:00,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 17:34:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-12-07 17:34:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:34:00,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:00,779 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:00,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:00,980 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:00,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1979212484, now seen corresponding path program 2 times [2019-12-07 17:34:00,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:00,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047779230] [2019-12-07 17:34:00,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:00,990 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 17:34:00,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620947204] [2019-12-07 17:34:00,990 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:01,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:34:01,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:01,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 17:34:01,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:01,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 17:34:01,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:01,049 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,049 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-12-07 17:34:01,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-07 17:34:01,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:01,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:01,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-12-07 17:34:01,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-12-07 17:34:01,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:01,137 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:01,137 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:35 [2019-12-07 17:34:01,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-12-07 17:34:01,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:01,173 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:01,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:35 [2019-12-07 17:34:01,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-12-07 17:34:01,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,208 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:01,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:01,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:30 [2019-12-07 17:34:01,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:01,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:01,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 17:34:01,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:01,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:01,260 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-12-07 17:34:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:34:01,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047779230] [2019-12-07 17:34:01,275 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 17:34:01,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620947204] [2019-12-07 17:34:01,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:34:01,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-12-07 17:34:01,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136816376] [2019-12-07 17:34:01,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:34:01,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:34:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:34:01,276 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 15 states. [2019-12-07 17:34:02,520 WARN L192 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-12-07 17:34:02,845 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-07 17:34:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:02,885 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-12-07 17:34:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:34:02,885 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-12-07 17:34:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:02,886 INFO L225 Difference]: With dead ends: 62 [2019-12-07 17:34:02,886 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 17:34:02,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:34:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 17:34:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-12-07 17:34:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 17:34:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-12-07 17:34:02,892 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2019-12-07 17:34:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:02,892 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-12-07 17:34:02,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:34:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-12-07 17:34:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:34:02,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:02,893 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:03,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:03,093 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1893861880, now seen corresponding path program 3 times [2019-12-07 17:34:03,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:03,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701690897] [2019-12-07 17:34:03,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:03,100 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 17:34:03,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553392887] [2019-12-07 17:34:03,100 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:03,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 17:34:03,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:03,144 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 17:34:03,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:03,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:34:03,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:03,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:03,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:03,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 17:34:03,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:03,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-07 17:34:03,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:03,201 INFO L614 ElimStorePlain]: treesize reduction 30, result has 49.2 percent of original size [2019-12-07 17:34:03,201 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:03,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:34:03,608 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 17:34:03,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:03,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 118 [2019-12-07 17:34:03,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:03,653 INFO L614 ElimStorePlain]: treesize reduction 66, result has 40.5 percent of original size [2019-12-07 17:34:03,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:03,654 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-12-07 17:34:10,081 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:34:10,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:10,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:10,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:10,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 77 [2019-12-07 17:34:10,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:10,113 INFO L614 ElimStorePlain]: treesize reduction 44, result has 45.7 percent of original size [2019-12-07 17:34:10,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:10,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:37 [2019-12-07 17:34:10,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:10,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:10,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:10,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 77 [2019-12-07 17:34:10,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:10,546 INFO L614 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-12-07 17:34:10,547 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:10,547 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:32 [2019-12-07 17:34:10,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:34:10,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:10,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 35 [2019-12-07 17:34:10,608 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:10,616 INFO L614 ElimStorePlain]: treesize reduction 12, result has 50.0 percent of original size [2019-12-07 17:34:10,616 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:10,616 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-12-07 17:34:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:34:10,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701690897] [2019-12-07 17:34:10,631 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 17:34:10,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553392887] [2019-12-07 17:34:10,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:34:10,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-12-07 17:34:10,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023578502] [2019-12-07 17:34:10,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:34:10,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:34:10,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2019-12-07 17:34:10,632 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 14 states. [2019-12-07 17:34:21,571 WARN L192 SmtUtils]: Spent 3.94 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 17:34:28,001 WARN L192 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 17:34:30,686 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 17:34:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:40,844 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-12-07 17:34:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:34:40,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-12-07 17:34:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:40,847 INFO L225 Difference]: With dead ends: 64 [2019-12-07 17:34:40,847 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 17:34:40,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=86, Invalid=283, Unknown=11, NotChecked=0, Total=380 [2019-12-07 17:34:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 17:34:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 17:34:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 17:34:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-12-07 17:34:40,854 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 34 [2019-12-07 17:34:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:40,854 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-12-07 17:34:40,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:34:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-12-07 17:34:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:34:40,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:40,854 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:41,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:41,055 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1035254296, now seen corresponding path program 14 times [2019-12-07 17:34:41,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:41,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372683411] [2019-12-07 17:34:41,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:41,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372683411] [2019-12-07 17:34:41,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142260506] [2019-12-07 17:34:41,140 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:41,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:34:41,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:41,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:34:41,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:41,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:41,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-12-07 17:34:41,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109465601] [2019-12-07 17:34:41,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:34:41,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:34:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:34:41,233 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 22 states. [2019-12-07 17:34:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:41,510 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-12-07 17:34:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:34:41,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-12-07 17:34:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:41,511 INFO L225 Difference]: With dead ends: 63 [2019-12-07 17:34:41,511 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 17:34:41,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:34:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 17:34:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2019-12-07 17:34:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 17:34:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-12-07 17:34:41,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 36 [2019-12-07 17:34:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-12-07 17:34:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:34:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-12-07 17:34:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:34:41,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:41,517 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:41,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:41,718 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash -127223707, now seen corresponding path program 15 times [2019-12-07 17:34:41,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:41,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519016910] [2019-12-07 17:34:41,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:41,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519016910] [2019-12-07 17:34:41,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803566638] [2019-12-07 17:34:41,821 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:41,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 17:34:41,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:41,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:34:41,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:41,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:41,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-12-07 17:34:41,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671018978] [2019-12-07 17:34:41,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:34:41,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:34:41,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:34:41,952 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 22 states. [2019-12-07 17:34:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:42,083 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-12-07 17:34:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:34:42,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-12-07 17:34:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:42,084 INFO L225 Difference]: With dead ends: 67 [2019-12-07 17:34:42,084 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 17:34:42,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:34:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 17:34:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-12-07 17:34:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 17:34:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-12-07 17:34:42,089 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2019-12-07 17:34:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:42,089 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-12-07 17:34:42,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:34:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-12-07 17:34:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:34:42,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:42,089 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:42,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:42,290 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 639592647, now seen corresponding path program 16 times [2019-12-07 17:34:42,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:42,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389991434] [2019-12-07 17:34:42,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:43,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389991434] [2019-12-07 17:34:43,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205570078] [2019-12-07 17:34:43,167 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:43,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:34:43,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:43,207 WARN L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 17:34:43,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:43,212 INFO L377 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 10 treesize of output 8 [2019-12-07 17:34:43,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:43,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:43,219 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:43,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,224 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 17:34:43,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:34:43,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:43,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,266 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:34:43,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:43,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-12-07 17:34:43,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,386 INFO L614 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-12-07 17:34:43,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:43,386 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-12-07 17:34:43,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:43,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-12-07 17:34:43,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,559 INFO L614 ElimStorePlain]: treesize reduction 72, result has 45.9 percent of original size [2019-12-07 17:34:43,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:43,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-12-07 17:34:43,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:43,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-12-07 17:34:43,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:43,812 INFO L614 ElimStorePlain]: treesize reduction 108, result has 41.6 percent of original size [2019-12-07 17:34:43,812 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:43,812 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-12-07 17:34:44,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:44,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 318 [2019-12-07 17:34:44,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:44,107 INFO L614 ElimStorePlain]: treesize reduction 144, result has 39.2 percent of original size [2019-12-07 17:34:44,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:44,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:93 [2019-12-07 17:34:44,429 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 17:34:44,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:44,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 432 [2019-12-07 17:34:44,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:44,511 INFO L614 ElimStorePlain]: treesize reduction 180, result has 37.7 percent of original size [2019-12-07 17:34:44,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:44,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:113, output treesize:109 [2019-12-07 17:34:50,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:50,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 110 treesize of output 447 [2019-12-07 17:34:50,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:50,399 INFO L614 ElimStorePlain]: treesize reduction 360, result has 26.4 percent of original size [2019-12-07 17:34:50,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:50,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:150, output treesize:129 [2019-12-07 17:34:50,904 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-12-07 17:34:50,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:50,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 125 treesize of output 573 [2019-12-07 17:34:50,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:51,059 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 74 [2019-12-07 17:34:51,059 INFO L614 ElimStorePlain]: treesize reduction 824, result has 16.7 percent of original size [2019-12-07 17:34:51,060 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:51,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:170, output treesize:165 [2019-12-07 17:34:51,937 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-12-07 17:34:51,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:51,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 156 treesize of output 719 [2019-12-07 17:34:51,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:52,093 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 80 [2019-12-07 17:34:52,094 INFO L614 ElimStorePlain]: treesize reduction 800, result has 18.0 percent of original size [2019-12-07 17:34:52,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:52,095 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:206, output treesize:176 [2019-12-07 17:34:52,395 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-07 17:34:53,124 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2019-12-07 17:34:53,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:53,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 162 treesize of output 876 [2019-12-07 17:34:53,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:53,311 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 87 [2019-12-07 17:34:53,312 INFO L614 ElimStorePlain]: treesize reduction 920, result has 15.8 percent of original size [2019-12-07 17:34:53,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:53,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:217, output treesize:173 [2019-12-07 17:34:54,130 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-07 17:34:54,585 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2019-12-07 17:34:54,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:54,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 154 treesize of output 1047 [2019-12-07 17:34:54,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:54,773 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 95 [2019-12-07 17:34:54,773 INFO L614 ElimStorePlain]: treesize reduction 864, result has 18.7 percent of original size [2019-12-07 17:34:54,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:54,774 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:214, output treesize:199 [2019-12-07 17:35:06,780 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 17:35:07,547 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-07 17:35:08,172 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 315 [2019-12-07 17:35:08,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:35:08,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 66 case distinctions, treesize of input 175 treesize of output 1239 [2019-12-07 17:35:08,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:35:08,358 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 78 [2019-12-07 17:35:08,359 INFO L614 ElimStorePlain]: treesize reduction 1026, result has 12.2 percent of original size [2019-12-07 17:35:08,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-12-07 17:35:08,523 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 15 variables, input treesize:243, output treesize:114 [2019-12-07 17:35:08,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:35:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:08,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:35:08,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 65 [2019-12-07 17:35:08,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563428396] [2019-12-07 17:35:08,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-12-07 17:35:08,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-12-07 17:35:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3930, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 17:35:08,770 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 65 states. [2019-12-07 17:35:36,169 WARN L192 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-07 17:36:15,792 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-12-07 17:36:26,802 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-12-07 17:36:39,855 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-12-07 17:37:11,972 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-12-07 17:37:25,305 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2019-12-07 17:37:43,565 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-12-07 17:38:10,109 WARN L192 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 17:38:30,296 WARN L192 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2019-12-07 17:38:47,588 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 104 [2019-12-07 17:39:00,168 WARN L192 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 118 [2019-12-07 17:39:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:26,797 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-12-07 17:39:26,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 17:39:26,798 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 39 [2019-12-07 17:39:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:26,798 INFO L225 Difference]: With dead ends: 87 [2019-12-07 17:39:26,799 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 17:39:26,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 75.0s TimeCoverageRelationStatistics Valid=564, Invalid=8743, Unknown=5, NotChecked=0, Total=9312 [2019-12-07 17:39:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 17:39:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-12-07 17:39:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 17:39:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-12-07 17:39:26,809 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 39 [2019-12-07 17:39:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:26,809 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-12-07 17:39:26,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-12-07 17:39:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-12-07 17:39:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:39:26,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:26,810 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:27,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:27,011 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1184266071, now seen corresponding path program 17 times [2019-12-07 17:39:27,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:27,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727682603] [2019-12-07 17:39:27,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:27,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727682603] [2019-12-07 17:39:27,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098879227] [2019-12-07 17:39:27,133 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:27,207 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-07 17:39:27,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:39:27,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:39:27,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:27,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:39:27,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-12-07 17:39:27,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970744336] [2019-12-07 17:39:27,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 17:39:27,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:27,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 17:39:27,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:39:27,283 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 25 states. [2019-12-07 17:39:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:27,582 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-12-07 17:39:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:39:27,582 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-12-07 17:39:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:27,582 INFO L225 Difference]: With dead ends: 71 [2019-12-07 17:39:27,582 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 17:39:27,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=1140, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 17:39:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 17:39:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-12-07 17:39:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 17:39:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-12-07 17:39:27,591 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2019-12-07 17:39:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:27,592 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-12-07 17:39:27,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 17:39:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-12-07 17:39:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:39:27,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:27,592 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:27,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:27,793 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1126332488, now seen corresponding path program 18 times [2019-12-07 17:39:27,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:27,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021325772] [2019-12-07 17:39:27,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:27,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021325772] [2019-12-07 17:39:27,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17280909] [2019-12-07 17:39:27,887 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:27,952 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-07 17:39:27,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:39:27,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:39:27,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:28,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:39:28,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-12-07 17:39:28,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440221975] [2019-12-07 17:39:28,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 17:39:28,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:28,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 17:39:28,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:39:28,042 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 25 states. [2019-12-07 17:39:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:28,206 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-12-07 17:39:28,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:39:28,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-12-07 17:39:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:28,206 INFO L225 Difference]: With dead ends: 75 [2019-12-07 17:39:28,206 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 17:39:28,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:39:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 17:39:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-12-07 17:39:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 17:39:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-12-07 17:39:28,212 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2019-12-07 17:39:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:28,212 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-12-07 17:39:28,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 17:39:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-12-07 17:39:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:39:28,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:28,213 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:28,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:28,413 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash -70138730, now seen corresponding path program 19 times [2019-12-07 17:39:28,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:28,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893048013] [2019-12-07 17:39:28,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:29,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893048013] [2019-12-07 17:39:29,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538633205] [2019-12-07 17:39:29,481 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:29,514 WARN L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 73 conjunts are in the unsatisfiable core [2019-12-07 17:39:29,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:29,518 INFO L377 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 10 treesize of output 8 [2019-12-07 17:39:29,518 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:29,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:39:29,526 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:29,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,530 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 17:39:29,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:39:29,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:29,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,571 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:39:29,655 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-12-07 17:39:29,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2019-12-07 17:39:29,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:29,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-12-07 17:39:29,781 INFO L343 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-12-07 17:39:29,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 17:39:29,782 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:29,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-12-07 17:39:29,916 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-12-07 17:39:29,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2019-12-07 17:39:29,917 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:29,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:29,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2019-12-07 17:39:30,106 INFO L343 Elim1Store]: treesize reduction 66, result has 69.3 percent of original size [2019-12-07 17:39:30,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 182 [2019-12-07 17:39:30,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:30,147 INFO L614 ElimStorePlain]: treesize reduction 114, result has 35.6 percent of original size [2019-12-07 17:39:30,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:30,147 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-12-07 17:39:30,353 INFO L343 Elim1Store]: treesize reduction 163, result has 49.7 percent of original size [2019-12-07 17:39:30,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 197 [2019-12-07 17:39:30,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:30,399 INFO L614 ElimStorePlain]: treesize reduction 114, result has 39.7 percent of original size [2019-12-07 17:39:30,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:30,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-12-07 17:39:30,811 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 56 [2019-12-07 17:39:30,812 INFO L343 Elim1Store]: treesize reduction 278, result has 38.4 percent of original size [2019-12-07 17:39:30,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 212 [2019-12-07 17:39:30,812 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:30,873 INFO L614 ElimStorePlain]: treesize reduction 114, result has 44.1 percent of original size [2019-12-07 17:39:30,873 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:30,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2019-12-07 17:39:31,262 INFO L343 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-12-07 17:39:31,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 205 [2019-12-07 17:39:31,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:31,305 INFO L614 ElimStorePlain]: treesize reduction 142, result has 39.8 percent of original size [2019-12-07 17:39:31,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:31,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:115, output treesize:94 [2019-12-07 17:39:33,393 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 17:39:35,027 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 17:39:35,172 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-12-07 17:39:35,172 INFO L343 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-12-07 17:39:35,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 331 [2019-12-07 17:39:35,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:35,241 INFO L614 ElimStorePlain]: treesize reduction 416, result has 23.1 percent of original size [2019-12-07 17:39:35,241 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:35,241 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:130, output treesize:125 [2019-12-07 17:39:35,724 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-12-07 17:39:35,724 INFO L343 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-12-07 17:39:35,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 151 treesize of output 477 [2019-12-07 17:39:35,727 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:35,813 INFO L614 ElimStorePlain]: treesize reduction 618, result has 17.5 percent of original size [2019-12-07 17:39:35,814 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:35,814 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:161, output treesize:131 [2019-12-07 17:39:36,333 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-12-07 17:39:36,333 INFO L343 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-12-07 17:39:36,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 146 treesize of output 476 [2019-12-07 17:39:36,335 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:36,398 INFO L614 ElimStorePlain]: treesize reduction 246, result has 33.2 percent of original size [2019-12-07 17:39:36,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:36,398 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:156, output treesize:122 [2019-12-07 17:39:36,844 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-12-07 17:39:36,844 INFO L343 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-12-07 17:39:36,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 126 treesize of output 333 [2019-12-07 17:39:36,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:36,914 INFO L614 ElimStorePlain]: treesize reduction 392, result has 23.4 percent of original size [2019-12-07 17:39:36,914 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:36,914 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:136, output treesize:120 [2019-12-07 17:39:37,432 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-12-07 17:39:37,432 INFO L343 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-12-07 17:39:37,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 146 treesize of output 476 [2019-12-07 17:39:37,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:37,528 INFO L614 ElimStorePlain]: treesize reduction 568, result has 18.7 percent of original size [2019-12-07 17:39:37,528 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:37,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:156, output treesize:131 [2019-12-07 17:39:38,088 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-12-07 17:39:38,088 INFO L343 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-12-07 17:39:38,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 146 treesize of output 476 [2019-12-07 17:39:38,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:38,176 INFO L614 ElimStorePlain]: treesize reduction 606, result has 18.8 percent of original size [2019-12-07 17:39:38,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:38,176 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:156, output treesize:140 [2019-12-07 17:39:38,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:39:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:38,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:39:38,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 67 [2019-12-07 17:39:38,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611133743] [2019-12-07 17:39:38,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-07 17:39:38,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-07 17:39:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4214, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 17:39:38,449 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 67 states. [2019-12-07 17:39:43,915 WARN L192 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-07 17:39:45,437 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-12-07 17:39:46,562 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-12-07 17:39:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:47,814 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-12-07 17:39:47,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 17:39:47,814 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 44 [2019-12-07 17:39:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:47,815 INFO L225 Difference]: With dead ends: 106 [2019-12-07 17:39:47,815 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 17:39:47,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2599 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=479, Invalid=9223, Unknown=0, NotChecked=0, Total=9702 [2019-12-07 17:39:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 17:39:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-12-07 17:39:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 17:39:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-12-07 17:39:47,825 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 44 [2019-12-07 17:39:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:47,826 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-12-07 17:39:47,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-12-07 17:39:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-12-07 17:39:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:39:47,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:47,826 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:48,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:48,027 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash 609919640, now seen corresponding path program 4 times [2019-12-07 17:39:48,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:48,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903657302] [2019-12-07 17:39:48,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:48,042 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 17:39:48,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633225442] [2019-12-07 17:39:48,042 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:48,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:39:48,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:39:48,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 17:39:48,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:48,126 INFO L377 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 10 treesize of output 8 [2019-12-07 17:39:48,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:48,131 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,131 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 17:39:48,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 17:39:48,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:48,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 17:39:48,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:48,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-07 17:39:48,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,218 INFO L614 ElimStorePlain]: treesize reduction 30, result has 50.8 percent of original size [2019-12-07 17:39:48,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-07 17:39:48,296 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 17:39:48,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-12-07 17:39:48,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,309 INFO L614 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-12-07 17:39:48,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-12-07 17:39:48,339 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 17:39:48,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-12-07 17:39:48,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,353 INFO L614 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-12-07 17:39:48,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,353 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-12-07 17:39:48,384 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 17:39:48,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-12-07 17:39:48,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,398 INFO L614 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-12-07 17:39:48,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-12-07 17:39:48,430 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 17:39:48,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-12-07 17:39:48,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,444 INFO L614 ElimStorePlain]: treesize reduction 56, result has 34.1 percent of original size [2019-12-07 17:39:48,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-12-07 17:39:48,482 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 17:39:48,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-12-07 17:39:48,482 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,495 INFO L614 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-12-07 17:39:48,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,496 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:25 [2019-12-07 17:39:48,545 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 17:39:48,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-12-07 17:39:48,546 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,554 INFO L614 ElimStorePlain]: treesize reduction 25, result has 28.6 percent of original size [2019-12-07 17:39:48,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:48,554 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:10 [2019-12-07 17:39:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:39:48,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903657302] [2019-12-07 17:39:48,578 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 17:39:48,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633225442] [2019-12-07 17:39:48,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:39:48,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-12-07 17:39:48,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173469587] [2019-12-07 17:39:48,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 17:39:48,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:48,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 17:39:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:39:48,579 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 21 states. [2019-12-07 17:39:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:48,963 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-12-07 17:39:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:39:48,963 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-12-07 17:39:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:48,964 INFO L225 Difference]: With dead ends: 99 [2019-12-07 17:39:48,964 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 17:39:48,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:39:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 17:39:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2019-12-07 17:39:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 17:39:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-12-07 17:39:48,973 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 44 [2019-12-07 17:39:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:48,973 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-12-07 17:39:48,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 17:39:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-12-07 17:39:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:39:48,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:48,974 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:49,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:49,175 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:49,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 188026708, now seen corresponding path program 5 times [2019-12-07 17:39:49,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:49,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757663145] [2019-12-07 17:39:49,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:49,183 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 17:39:49,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510916225] [2019-12-07 17:39:49,183 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:49,418 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-07 17:39:49,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:39:49,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 17:39:49,421 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:49,424 INFO L377 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 10 treesize of output 8 [2019-12-07 17:39:49,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:49,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 17:39:49,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 17:39:49,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:49,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 17:39:49,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-07 17:39:49,484 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:49,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,490 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-07 17:39:49,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-12-07 17:39:49,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:49,529 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:49,530 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-12-07 17:39:49,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-12-07 17:39:49,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,757 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:49,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:49,758 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:43 [2019-12-07 17:39:49,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-12-07 17:39:49,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:49,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:49,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:49,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:43 [2019-12-07 17:39:49,985 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 17:39:49,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:49,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-12-07 17:39:49,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:50,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:50,001 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:50,001 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:43 [2019-12-07 17:39:50,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-12-07 17:39:50,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:50,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:50,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:50,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:39 [2019-12-07 17:39:50,214 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 17:39:50,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:39:50,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:50,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 17:39:50,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:50,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:50,221 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:50,221 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-12-07 17:39:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 75 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:39:50,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757663145] [2019-12-07 17:39:50,242 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 17:39:50,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510916225] [2019-12-07 17:39:50,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:39:50,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-12-07 17:39:50,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896002005] [2019-12-07 17:39:50,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:39:50,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:50,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:39:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:39:50,243 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 19 states. [2019-12-07 17:39:50,825 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-12-07 17:39:50,975 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-07 17:39:52,266 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 17:39:53,599 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-12-07 17:39:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:53,656 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-12-07 17:39:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 17:39:53,656 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2019-12-07 17:39:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:53,657 INFO L225 Difference]: With dead ends: 84 [2019-12-07 17:39:53,657 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 17:39:53,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:39:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 17:39:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-12-07 17:39:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 17:39:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-12-07 17:39:53,666 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 44 [2019-12-07 17:39:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:53,666 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-12-07 17:39:53,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:39:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-12-07 17:39:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:39:53,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:53,667 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:53,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:53,868 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1319780852, now seen corresponding path program 20 times [2019-12-07 17:39:53,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:53,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546896796] [2019-12-07 17:39:53,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 36 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:54,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546896796] [2019-12-07 17:39:54,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179548064] [2019-12-07 17:39:54,001 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:54,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:39:54,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:39:54,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 17:39:54,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 49 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:54,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:39:54,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-12-07 17:39:54,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637249229] [2019-12-07 17:39:54,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:39:54,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:39:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:39:54,119 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 28 states. [2019-12-07 17:39:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:54,561 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-12-07 17:39:54,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 17:39:54,562 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2019-12-07 17:39:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:54,562 INFO L225 Difference]: With dead ends: 79 [2019-12-07 17:39:54,562 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 17:39:54,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=429, Invalid=1463, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 17:39:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 17:39:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2019-12-07 17:39:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 17:39:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-12-07 17:39:54,570 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 46 [2019-12-07 17:39:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:54,570 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-12-07 17:39:54,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:39:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-12-07 17:39:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:39:54,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:54,570 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:54,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:54,771 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -609786487, now seen corresponding path program 21 times [2019-12-07 17:39:54,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:54,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505817737] [2019-12-07 17:39:54,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:54,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505817737] [2019-12-07 17:39:54,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822843390] [2019-12-07 17:39:54,881 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:54,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 17:39:54,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:39:54,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 17:39:54,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:55,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:39:55,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-12-07 17:39:55,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75743677] [2019-12-07 17:39:55,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:39:55,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:39:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:39:55,097 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 28 states. [2019-12-07 17:39:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:55,260 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-12-07 17:39:55,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:39:55,261 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-12-07 17:39:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:55,261 INFO L225 Difference]: With dead ends: 83 [2019-12-07 17:39:55,261 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 17:39:55,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=309, Invalid=951, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:39:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 17:39:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-12-07 17:39:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 17:39:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 17:39:55,270 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 47 [2019-12-07 17:39:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:55,270 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 17:39:55,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:39:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 17:39:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:39:55,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:55,271 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:55,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:55,472 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1295219861, now seen corresponding path program 22 times [2019-12-07 17:39:55,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:55,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363994003] [2019-12-07 17:39:55,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:56,757 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-12-07 17:39:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:57,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363994003] [2019-12-07 17:39:57,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697605369] [2019-12-07 17:39:57,615 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:57,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:39:57,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:39:57,667 WARN L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-07 17:39:57,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:57,671 INFO L377 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 10 treesize of output 8 [2019-12-07 17:39:57,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:57,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:57,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:39:57,679 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:57,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:57,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:57,683 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 17:39:57,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:39:57,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:57,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:57,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:39:57,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:39:57,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:57,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-12-07 17:39:57,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:57,863 INFO L614 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-12-07 17:39:57,863 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:57,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-12-07 17:39:58,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:58,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-12-07 17:39:58,051 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:58,088 INFO L614 ElimStorePlain]: treesize reduction 72, result has 45.9 percent of original size [2019-12-07 17:39:58,089 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:58,089 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-12-07 17:39:58,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:58,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-12-07 17:39:58,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:58,569 INFO L614 ElimStorePlain]: treesize reduction 108, result has 41.6 percent of original size [2019-12-07 17:39:58,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:58,570 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-12-07 17:39:59,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:59,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 318 [2019-12-07 17:39:59,024 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:59,093 INFO L614 ElimStorePlain]: treesize reduction 144, result has 39.2 percent of original size [2019-12-07 17:39:59,093 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:59,093 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:93 [2019-12-07 17:39:59,610 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 17:39:59,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:39:59,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 432 [2019-12-07 17:39:59,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:39:59,693 INFO L614 ElimStorePlain]: treesize reduction 180, result has 37.7 percent of original size [2019-12-07 17:39:59,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 17:39:59,694 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:113, output treesize:109 [2019-12-07 17:40:00,534 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-12-07 17:40:00,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:40:00,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 562 [2019-12-07 17:40:00,535 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:40:00,640 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-12-07 17:40:00,640 INFO L614 ElimStorePlain]: treesize reduction 216, result has 36.7 percent of original size [2019-12-07 17:40:00,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 17:40:00,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:129, output treesize:125 [2019-12-07 17:40:09,801 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-12-07 17:40:09,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:40:09,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 708 [2019-12-07 17:40:09,803 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:40:09,925 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-12-07 17:40:09,925 INFO L614 ElimStorePlain]: treesize reduction 252, result has 35.9 percent of original size [2019-12-07 17:40:09,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-12-07 17:40:09,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:145, output treesize:141 [2019-12-07 17:41:29,687 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 17:41:29,687 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 17:41:29,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:41:29,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-12-07 17:41:29,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727225918] [2019-12-07 17:41:29,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 17:41:29,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 17:41:29,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2846, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 17:41:29,688 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 40 states. [2019-12-07 17:41:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:41:29,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:41:29,890 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@49ae22ac at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:41:29,897 INFO L168 Benchmark]: Toolchain (without parser) took 513489.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 935.2 MB in the beginning and 1.0 GB in the end (delta: -90.0 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:29,897 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:41:29,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:29,898 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:29,898 INFO L168 Benchmark]: Boogie Preprocessor took 17.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:29,898 INFO L168 Benchmark]: RCFGBuilder took 171.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:29,898 INFO L168 Benchmark]: TraceAbstraction took 513070.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.0 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:29,899 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 513070.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.0 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@49ae22ac de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@49ae22ac: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 17:41:30,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:41:30,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:41:30,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:41:30,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:41:30,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:41:30,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:41:30,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:41:30,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:41:30,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:41:30,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:41:30,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:41:30,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:41:30,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:41:31,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:41:31,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:41:31,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:41:31,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:41:31,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:41:31,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:41:31,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:41:31,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:41:31,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:41:31,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:41:31,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:41:31,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:41:31,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:41:31,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:41:31,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:41:31,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:41:31,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:41:31,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:41:31,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:41:31,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:41:31,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:41:31,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:41:31,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:41:31,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:41:31,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:41:31,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:41:31,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:41:31,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 17:41:31,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:41:31,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:41:31,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:41:31,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:41:31,028 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:41:31,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:41:31,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:41:31,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:41:31,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:41:31,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:41:31,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:41:31,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:41:31,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:41:31,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:41:31,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:41:31,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:41:31,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:41:31,031 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0c6762a510921214435f03fd1512220ceb2c5e3 [2019-12-07 17:41:31,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:41:31,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:41:31,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:41:31,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:41:31,217 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:41:31,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s4if.c [2019-12-07 17:41:31,259 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/6d61bb0a7/8c936163d5c946fe8f131275c91ed43e/FLAGe80c81e41 [2019-12-07 17:41:31,587 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:41:31,588 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/sv-benchmarks/c/array-fpi/s4if.c [2019-12-07 17:41:31,591 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/6d61bb0a7/8c936163d5c946fe8f131275c91ed43e/FLAGe80c81e41 [2019-12-07 17:41:31,600 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/data/6d61bb0a7/8c936163d5c946fe8f131275c91ed43e [2019-12-07 17:41:31,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:41:31,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:41:31,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:31,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:41:31,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:41:31,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb84b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31, skipping insertion in model container [2019-12-07 17:41:31,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:41:31,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:41:31,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:31,742 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:41:31,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:31,799 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:41:31,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31 WrapperNode [2019-12-07 17:41:31,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:31,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:31,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:41:31,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:41:31,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:31,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:41:31,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:41:31,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:41:31,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... [2019-12-07 17:41:31,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:41:31,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:41:31,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:41:31,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:41:31,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:41:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:41:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-12-07 17:41:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:41:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:41:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:41:31,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:41:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-12-07 17:41:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:41:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:41:32,066 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:41:32,066 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:41:32,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:32 BoogieIcfgContainer [2019-12-07 17:41:32,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:41:32,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:41:32,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:41:32,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:41:32,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:41:31" (1/3) ... [2019-12-07 17:41:32,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396cd227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:32, skipping insertion in model container [2019-12-07 17:41:32,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:31" (2/3) ... [2019-12-07 17:41:32,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396cd227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:32, skipping insertion in model container [2019-12-07 17:41:32,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:32" (3/3) ... [2019-12-07 17:41:32,071 INFO L109 eAbstractionObserver]: Analyzing ICFG s4if.c [2019-12-07 17:41:32,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:41:32,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:41:32,088 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:41:32,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:41:32,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:41:32,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:41:32,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:41:32,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:41:32,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:41:32,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:41:32,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:41:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-12-07 17:41:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:41:32,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:32,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:32,116 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-12-07 17:41:32,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:32,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371802497] [2019-12-07 17:41:32,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:32,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 17:41:32,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:32,188 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:32,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371802497] [2019-12-07 17:41:32,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:32,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 17:41:32,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748883104] [2019-12-07 17:41:32,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:41:32,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:32,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:41:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:41:32,205 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-12-07 17:41:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:32,216 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-12-07 17:41:32,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:41:32,216 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-12-07 17:41:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:32,222 INFO L225 Difference]: With dead ends: 29 [2019-12-07 17:41:32,222 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 17:41:32,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:41:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 17:41:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 17:41:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 17:41:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-12-07 17:41:32,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-12-07 17:41:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:32,246 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-12-07 17:41:32,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:41:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-12-07 17:41:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:41:32,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:32,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:32,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:41:32,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-12-07 17:41:32,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:32,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359211812] [2019-12-07 17:41:32,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:32,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:41:32,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:32,591 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:32,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359211812] [2019-12-07 17:41:32,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:32,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:41:32,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638784007] [2019-12-07 17:41:32,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:41:32,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:41:32,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:41:32,609 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2019-12-07 17:41:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:32,778 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-12-07 17:41:32,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:41:32,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 17:41:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:32,780 INFO L225 Difference]: With dead ends: 23 [2019-12-07 17:41:32,780 INFO L226 Difference]: Without dead ends: 15 [2019-12-07 17:41:32,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:41:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-12-07 17:41:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-12-07 17:41:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 17:41:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-12-07 17:41:32,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-12-07 17:41:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:32,783 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-12-07 17:41:32,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:41:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-12-07 17:41:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:41:32,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:32,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:32,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:41:32,985 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:32,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-12-07 17:41:32,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:32,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359907030] [2019-12-07 17:41:32,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:33,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:41:33,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:33,131 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:33,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359907030] [2019-12-07 17:41:33,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:33,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 17:41:33,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223860797] [2019-12-07 17:41:33,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:41:33,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:33,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:41:33,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:41:33,195 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 10 states. [2019-12-07 17:41:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:33,516 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-12-07 17:41:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:41:33,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-12-07 17:41:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:33,517 INFO L225 Difference]: With dead ends: 34 [2019-12-07 17:41:33,517 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 17:41:33,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:41:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 17:41:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-12-07 17:41:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 17:41:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-12-07 17:41:33,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2019-12-07 17:41:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:33,521 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-12-07 17:41:33,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:41:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-12-07 17:41:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:41:33,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:33,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:33,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:41:33,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-12-07 17:41:33,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:33,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871722952] [2019-12-07 17:41:33,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:33,805 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:41:33,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:33,837 INFO L377 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 10 treesize of output 8 [2019-12-07 17:41:33,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:33,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:33,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:41:33,876 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-07 17:41:33,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2019-12-07 17:41:33,876 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:33,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:33,896 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:33,897 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-12-07 17:41:33,926 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 17:41:33,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-12-07 17:41:33,927 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:33,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:33,949 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:33,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-12-07 17:41:34,149 INFO L343 Elim1Store]: treesize reduction 37, result has 26.0 percent of original size [2019-12-07 17:41:34,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 51 [2019-12-07 17:41:34,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:34,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:34,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:41:34,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:98, output treesize:66 [2019-12-07 17:41:34,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:34,253 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:38,905 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 17:41:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:38,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871722952] [2019-12-07 17:41:38,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:38,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 17:41:38,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361703670] [2019-12-07 17:41:38,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:41:38,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:41:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=188, Unknown=1, NotChecked=0, Total=240 [2019-12-07 17:41:38,917 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 16 states. [2019-12-07 17:41:41,166 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-12-07 17:41:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:44,096 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-12-07 17:41:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:41:44,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-12-07 17:41:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:44,098 INFO L225 Difference]: With dead ends: 33 [2019-12-07 17:41:44,098 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 17:41:44,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=69, Invalid=272, Unknown=1, NotChecked=0, Total=342 [2019-12-07 17:41:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 17:41:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-12-07 17:41:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 17:41:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-12-07 17:41:44,102 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2019-12-07 17:41:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:44,102 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-12-07 17:41:44,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:41:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-12-07 17:41:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:41:44,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:44,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:44,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:41:44,304 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1508379200, now seen corresponding path program 1 times [2019-12-07 17:41:44,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:44,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315584304] [2019-12-07 17:41:44,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:44,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:41:44,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:44,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:41:44,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:44,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:44,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:44,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:41:44,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 17:41:44,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:44,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:44,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:44,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2019-12-07 17:41:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:44,449 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:44,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-12-07 17:41:44,467 INFO L377 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 22 treesize of output 20 [2019-12-07 17:41:44,467 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:44,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:44,469 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:44,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:44,471 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:41:44,471 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:7 [2019-12-07 17:41:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:44,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315584304] [2019-12-07 17:41:44,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:44,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-07 17:41:44,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223339511] [2019-12-07 17:41:44,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:41:44,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:41:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:41:44,482 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-12-07 17:41:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:44,715 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-12-07 17:41:44,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:41:44,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 17:41:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:44,727 INFO L225 Difference]: With dead ends: 31 [2019-12-07 17:41:44,727 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 17:41:44,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:41:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 17:41:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-12-07 17:41:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 17:41:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-12-07 17:41:44,730 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2019-12-07 17:41:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:44,730 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-12-07 17:41:44,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:41:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-12-07 17:41:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:41:44,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:44,730 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:44,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:41:44,931 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash -472130976, now seen corresponding path program 2 times [2019-12-07 17:41:44,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:44,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803323232] [2019-12-07 17:41:44,933 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:45,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:41:45,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:45,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:41:45,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:45,097 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:45,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803323232] [2019-12-07 17:41:45,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:45,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 17:41:45,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585624123] [2019-12-07 17:41:45,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:41:45,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:41:45,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:41:45,266 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2019-12-07 17:41:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:45,675 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-12-07 17:41:45,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:41:45,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-12-07 17:41:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:45,676 INFO L225 Difference]: With dead ends: 42 [2019-12-07 17:41:45,676 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 17:41:45,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:41:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 17:41:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-12-07 17:41:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 17:41:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-12-07 17:41:45,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-12-07 17:41:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:45,681 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-12-07 17:41:45,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:41:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-12-07 17:41:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:41:45,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:45,681 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:45,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:41:45,883 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1991965825, now seen corresponding path program 3 times [2019-12-07 17:41:45,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:45,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953071379] [2019-12-07 17:41:45,886 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:45,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 17:41:45,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:45,996 WARN L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 17:41:45,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:46,006 INFO L377 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 10 treesize of output 8 [2019-12-07 17:41:46,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:46,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:41:46,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:41:46,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-12-07 17:41:46,033 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:46,049 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,050 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2019-12-07 17:41:46,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:41:46,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-12-07 17:41:46,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,124 INFO L614 ElimStorePlain]: treesize reduction 4, result has 92.3 percent of original size [2019-12-07 17:41:46,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2019-12-07 17:41:46,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:41:46,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:41:46,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:46,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 76 [2019-12-07 17:41:46,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,271 INFO L614 ElimStorePlain]: treesize reduction 36, result has 61.7 percent of original size [2019-12-07 17:41:46,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,272 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:58 [2019-12-07 17:41:46,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:41:46,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:41:46,540 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:41:46,541 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:41:46,851 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-07 17:41:46,852 INFO L343 Elim1Store]: treesize reduction 32, result has 74.8 percent of original size [2019-12-07 17:41:46,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 116 treesize of output 146 [2019-12-07 17:41:46,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,908 INFO L614 ElimStorePlain]: treesize reduction 87, result has 44.9 percent of original size [2019-12-07 17:41:46,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:41:46,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:132, output treesize:71 [2019-12-07 17:41:47,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:41:47,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:41:47,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:41:47,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 107 treesize of output 135 [2019-12-07 17:41:47,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:41:47,132 INFO L614 ElimStorePlain]: treesize reduction 120, result has 43.7 percent of original size [2019-12-07 17:41:47,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:41:47,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:117, output treesize:93 [2019-12-07 17:41:47,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:47,241 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:49,323 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 17:41:49,906 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 17:41:51,232 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 17:41:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:51,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953071379] [2019-12-07 17:41:51,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:51,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-12-07 17:41:51,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287517864] [2019-12-07 17:41:51,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 17:41:51,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 17:41:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:41:51,249 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 26 states. [2019-12-07 17:41:59,955 WARN L192 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 143 DAG size of output: 110 [2019-12-07 17:42:05,283 WARN L192 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 17:42:15,580 WARN L192 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 148 DAG size of output: 90 [2019-12-07 17:42:22,771 WARN L192 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 152 DAG size of output: 63 [2019-12-07 17:42:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:22,866 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-12-07 17:42:22,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:42:22,868 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 19 [2019-12-07 17:42:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:22,869 INFO L225 Difference]: With dead ends: 37 [2019-12-07 17:42:22,869 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 17:42:22,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=150, Invalid=779, Unknown=1, NotChecked=0, Total=930 [2019-12-07 17:42:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 17:42:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-12-07 17:42:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 17:42:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-12-07 17:42:22,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2019-12-07 17:42:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:22,873 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-12-07 17:42:22,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 17:42:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-12-07 17:42:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:42:22,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:22,874 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:23,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:42:23,075 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1934707523, now seen corresponding path program 1 times [2019-12-07 17:42:23,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:42:23,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341931400] [2019-12-07 17:42:23,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 17:42:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:23,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:42:23,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:42:23,238 INFO L377 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 10 treesize of output 8 [2019-12-07 17:42:23,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:42:23,244 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:42:23,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:42:23,245 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 17:42:23,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:42:23,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:42:23,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:42:23,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:42:23,277 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 17:42:23,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:42:23,325 INFO L343 Elim1Store]: treesize reduction 37, result has 26.0 percent of original size [2019-12-07 17:42:23,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 54 [2019-12-07 17:42:23,327 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:42:23,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:42:23,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:42:23,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:64 [2019-12-07 17:42:27,462 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 17:42:29,548 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 17:42:29,555 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 17:42:29,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 27 [2019-12-07 17:42:29,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:42:29,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:42:29,560 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:42:29,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:5 [2019-12-07 17:42:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:29,580 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:42:32,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341931400] [2019-12-07 17:42:32,043 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 17:42:32,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1240078248] [2019-12-07 17:42:32,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:42:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:32,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:42:32,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:42:32,246 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1e249e36 [2019-12-07 17:42:32,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180182395] [2019-12-07 17:42:32,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d460a130-4091-4592-a73c-ba6415f0d430/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:42:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:32,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:42:32,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:42:32,311 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1e249e36 [2019-12-07 17:42:32,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:32,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 17:42:32,312 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 17:42:32,312 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:42:32,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:42:32,930 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 17:42:32,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:42:32 BoogieIcfgContainer [2019-12-07 17:42:32,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:42:32,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:42:32,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:42:32,931 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:42:32,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:32" (3/4) ... [2019-12-07 17:42:32,934 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:42:32,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:42:32,935 INFO L168 Benchmark]: Toolchain (without parser) took 61332.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -287.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:32,935 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:32,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:32,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:32,936 INFO L168 Benchmark]: Boogie Preprocessor took 19.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:32,936 INFO L168 Benchmark]: RCFGBuilder took 220.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:32,937 INFO L168 Benchmark]: TraceAbstraction took 60862.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:32,937 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:32,938 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 220.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60862.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 10]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L14] int N; [L18] N = __VERIFIER_nondet_int() [L19] COND FALSE !(N <= 0) [L22] int i; [L23] long long sum[1]; [L24] int *a = malloc(sizeof(int)*N); [L26] sum[0] = 0 [L27] i=0 [L27] COND TRUE i