./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.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_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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 9cd87c15c4637a3ecd407847e5a675763d5fece5 ................................................................................................................................................................................................................................ 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_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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 9cd87c15c4637a3ecd407847e5a675763d5fece5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:41:00,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:41:00,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:41:00,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:41:00,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:41:00,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:41:00,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:41:00,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:41:00,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:41:00,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:41:00,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:41:00,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:41:00,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:41:00,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:41:00,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:41:00,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:41:00,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:41:00,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:41:00,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:41:00,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:41:00,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:41:00,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:41:00,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:41:00,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:41:00,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:41:00,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:41:00,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:41:00,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:41:00,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:41:00,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:41:00,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:41:00,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:41:00,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:41:00,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:41:00,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:41:00,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:41:00,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:41:00,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:41:00,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:41:00,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:41:00,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:41:00,987 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:41:01,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:41:01,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:41:01,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:41:01,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:41:01,002 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:41:01,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:41:01,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:41:01,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:41:01,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:41:01,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:41:01,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:41:01,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:41:01,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:41:01,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:41:01,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:41:01,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:41:01,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:41:01,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:41:01,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:41:01,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:41:01,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:41:01,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:41:01,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:41:01,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:41:01,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:41:01,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:41:01,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:41:01,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:41:01,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:41:01,006 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_0dfd650a-fc1a-4637-a206-c83251d88752/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 -> 9cd87c15c4637a3ecd407847e5a675763d5fece5 [2019-12-07 17:41:01,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:41:01,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:41:01,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:41:01,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:41:01,122 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:41:01,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-12-07 17:41:01,168 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/9a8feddbb/6c45c78b53f74a97a220c4cd10bf3dd8/FLAGc502f771f [2019-12-07 17:41:01,486 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:41:01,486 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-12-07 17:41:01,490 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/9a8feddbb/6c45c78b53f74a97a220c4cd10bf3dd8/FLAGc502f771f [2019-12-07 17:41:01,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/9a8feddbb/6c45c78b53f74a97a220c4cd10bf3dd8 [2019-12-07 17:41:01,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:41:01,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:41:01,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:01,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:41:01,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:41:01,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:01" (1/1) ... [2019-12-07 17:41:01,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5972f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:01, skipping insertion in model container [2019-12-07 17:41:01,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:01" (1/1) ... [2019-12-07 17:41:01,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:41:01,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:41:01,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:01,653 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:41:01,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:01,673 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:41:01,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:01 WrapperNode [2019-12-07 17:41:01,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:01,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:01,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:41:01,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:41:01,680 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:01" (1/1) ... [2019-12-07 17:41:01,683 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:01" (1/1) ... [2019-12-07 17:41:01,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:01,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:41:01,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:41:01,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:41:01,700 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:01" (1/1) ... [2019-12-07 17:41:01,700 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:01" (1/1) ... [2019-12-07 17:41:01,700 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:01" (1/1) ... [2019-12-07 17:41:01,700 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:01" (1/1) ... [2019-12-07 17:41:01,702 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:01" (1/1) ... [2019-12-07 17:41:01,704 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:01" (1/1) ... [2019-12-07 17:41:01,704 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:01" (1/1) ... [2019-12-07 17:41:01,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:41:01,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:41:01,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:41:01,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:41:01,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-12-07 17:41:01,744 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-12-07 17:41:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:41:01,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:41:01,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:41:01,842 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 17:41:01,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:01 BoogieIcfgContainer [2019-12-07 17:41:01,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:41:01,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:41:01,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:41:01,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:41:01,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:41:01" (1/3) ... [2019-12-07 17:41:01,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c795700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:01, skipping insertion in model container [2019-12-07 17:41:01,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:01" (2/3) ... [2019-12-07 17:41:01,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c795700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:01, skipping insertion in model container [2019-12-07 17:41:01,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:01" (3/3) ... [2019-12-07 17:41:01,847 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2019-12-07 17:41:01,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:41:01,857 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:41:01,864 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:41:01,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:41:01,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:41:01,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:41:01,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:41:01,879 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:41:01,879 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:41:01,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:41:01,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:41:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-12-07 17:41:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:41:01,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:01,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:01,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2032829855, now seen corresponding path program 1 times [2019-12-07 17:41:01,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:01,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777125010] [2019-12-07 17:41:01,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:41:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:41:01,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:41:01,989 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:41:02,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:41:02 BoogieIcfgContainer [2019-12-07 17:41:02,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:41:02,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:41:02,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:41:02,004 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:41:02,005 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:01" (3/4) ... [2019-12-07 17:41:02,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:41:02,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:41:02,008 INFO L168 Benchmark]: Toolchain (without parser) took 506.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -103.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:41:02,009 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:41:02,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:02,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:41:02,010 INFO L168 Benchmark]: Boogie Preprocessor took 10.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:41:02,010 INFO L168 Benchmark]: RCFGBuilder took 137.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:02,011 INFO L168 Benchmark]: TraceAbstraction took 160.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:02,011 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:41:02,014 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 137.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 160.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 34]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 31. Possible FailurePath: [L25] int n = __VERIFIER_nondet_int(); [L26] COND FALSE !(n < 1) [L29] CALL, EXPR hanoi(n) VAL [\old(n)=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L29] RET, EXPR hanoi(n) [L29] unsigned result = hanoi(n); [L31] COND FALSE !(result+1>0 && result+1 == 1< main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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 -> 9cd87c15c4637a3ecd407847e5a675763d5fece5 [2019-12-07 17:41:03,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:41:03,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:41:03,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:41:03,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:41:03,567 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:41:03,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-12-07 17:41:03,605 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/f0a0a50d2/bc2fc8bd19df4b8db4e5a35dd323a4b8/FLAG627373f5a [2019-12-07 17:41:04,039 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:41:04,039 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-12-07 17:41:04,043 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/f0a0a50d2/bc2fc8bd19df4b8db4e5a35dd323a4b8/FLAG627373f5a [2019-12-07 17:41:04,052 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/data/f0a0a50d2/bc2fc8bd19df4b8db4e5a35dd323a4b8 [2019-12-07 17:41:04,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:41:04,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:41:04,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:04,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:41:04,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:41:04,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:04" (1/1) ... [2019-12-07 17:41:04,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ab2b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:04, skipping insertion in model container [2019-12-07 17:41:04,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:04" (1/1) ... [2019-12-07 17:41:04,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:41:04,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:41:04,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:04,174 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:41:04,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:04,197 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:41:04,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:04 WrapperNode [2019-12-07 17:41:04,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:04,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:04,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:41:04,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:41:04,205 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:04" (1/1) ... [2019-12-07 17:41:04,209 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:04" (1/1) ... [2019-12-07 17:41:04,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:04,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:41:04,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:41:04,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:41:04,256 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:04" (1/1) ... [2019-12-07 17:41:04,256 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:04" (1/1) ... [2019-12-07 17:41:04,257 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:04" (1/1) ... [2019-12-07 17:41:04,257 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:04" (1/1) ... [2019-12-07 17:41:04,259 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:04" (1/1) ... [2019-12-07 17:41:04,261 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:04" (1/1) ... [2019-12-07 17:41:04,261 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:04" (1/1) ... [2019-12-07 17:41:04,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:41:04,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:41:04,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:41:04,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:41:04,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-12-07 17:41:04,301 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-12-07 17:41:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:41:04,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:41:04,407 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:41:04,407 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 17:41:04,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:04 BoogieIcfgContainer [2019-12-07 17:41:04,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:41:04,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:41:04,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:41:04,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:41:04,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:41:04" (1/3) ... [2019-12-07 17:41:04,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5e4416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:04, skipping insertion in model container [2019-12-07 17:41:04,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:04" (2/3) ... [2019-12-07 17:41:04,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5e4416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:04, skipping insertion in model container [2019-12-07 17:41:04,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:04" (3/3) ... [2019-12-07 17:41:04,415 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2019-12-07 17:41:04,422 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:41:04,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:41:04,434 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:41:04,448 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:41:04,448 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:41:04,448 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:41:04,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:41:04,448 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:41:04,448 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:41:04,449 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:41:04,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:41:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-12-07 17:41:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:41:04,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:04,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:04,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2032829855, now seen corresponding path program 1 times [2019-12-07 17:41:04,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:04,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221333176] [2019-12-07 17:41:04,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:04,514 WARN L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:41:04,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:04,623 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:04,623 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:04,768 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:04,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221333176] [2019-12-07 17:41:04,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:04,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-12-07 17:41:04,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439251390] [2019-12-07 17:41:04,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:41:04,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:04,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:41:04,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:41:04,783 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 11 states. [2019-12-07 17:41:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:04,955 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-12-07 17:41:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:41:04,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-12-07 17:41:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:04,962 INFO L225 Difference]: With dead ends: 31 [2019-12-07 17:41:04,962 INFO L226 Difference]: Without dead ends: 15 [2019-12-07 17:41:04,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:41:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-12-07 17:41:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-12-07 17:41:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 17:41:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-12-07 17:41:04,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-12-07 17:41:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:04,991 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-12-07 17:41:04,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:41:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-12-07 17:41:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:41:04,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:04,992 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:05,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:41:05,193 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1521841779, now seen corresponding path program 1 times [2019-12-07 17:41:05,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:05,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5480945] [2019-12-07 17:41:05,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:05,229 WARN L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:41:05,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:41:05,372 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:05,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:41:05,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5480945] [2019-12-07 17:41:05,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:05,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 17:41:05,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232675659] [2019-12-07 17:41:05,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:41:05,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:41:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:41:05,746 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 16 states. [2019-12-07 17:41:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:06,110 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-12-07 17:41:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:41:06,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-12-07 17:41:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:06,112 INFO L225 Difference]: With dead ends: 27 [2019-12-07 17:41:06,112 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 17:41:06,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:41:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 17:41:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 17:41:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 17:41:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 17:41:06,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2019-12-07 17:41:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:06,120 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 17:41:06,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:41:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-12-07 17:41:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:41:06,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:06,122 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:06,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:41:06,323 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash -88960435, now seen corresponding path program 2 times [2019-12-07 17:41:06,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:06,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904172873] [2019-12-07 17:41:06,325 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:06,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:41:06,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:06,373 WARN L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 17:41:06,376 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:41:06,538 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:07,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:07,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:07,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:07,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:07,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:41:07,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904172873] [2019-12-07 17:41:07,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:07,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-12-07 17:41:07,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685127305] [2019-12-07 17:41:07,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 17:41:07,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:07,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 17:41:07,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:41:07,563 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 26 states. [2019-12-07 17:41:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:08,154 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-12-07 17:41:08,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:41:08,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-12-07 17:41:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:08,157 INFO L225 Difference]: With dead ends: 33 [2019-12-07 17:41:08,157 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 17:41:08,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 17:41:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 17:41:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 17:41:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 17:41:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-12-07 17:41:08,164 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 28 [2019-12-07 17:41:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:08,164 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 17:41:08,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 17:41:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-12-07 17:41:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:41:08,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:08,166 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:08,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:41:08,367 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1444383501, now seen corresponding path program 3 times [2019-12-07 17:41:08,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:08,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664306404] [2019-12-07 17:41:08,369 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:08,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 17:41:08,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:08,427 WARN L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 17:41:08,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 17:41:08,691 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:09,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:09,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:09,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:10,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:10,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:10,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:41:10,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664306404] [2019-12-07 17:41:10,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:10,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2019-12-07 17:41:10,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673451007] [2019-12-07 17:41:10,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 17:41:10,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:10,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 17:41:10,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:41:10,614 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 36 states. [2019-12-07 17:41:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:11,614 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-12-07 17:41:11,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:41:11,615 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-12-07 17:41:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:11,616 INFO L225 Difference]: With dead ends: 39 [2019-12-07 17:41:11,616 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 17:41:11,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 17:41:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 17:41:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 17:41:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 17:41:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-12-07 17:41:11,623 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 40 [2019-12-07 17:41:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:11,623 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-12-07 17:41:11,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 17:41:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-12-07 17:41:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:41:11,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:11,625 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:11,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:41:11,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash 608531405, now seen corresponding path program 4 times [2019-12-07 17:41:11,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:11,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593042403] [2019-12-07 17:41:11,828 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:11,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:41:11,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:11,883 WARN L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 17:41:11,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 17:41:12,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:12,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:12,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:13,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:14,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:14,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 17:41:15,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593042403] [2019-12-07 17:41:15,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:15,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2019-12-07 17:41:15,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684542863] [2019-12-07 17:41:15,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 17:41:15,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:15,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 17:41:15,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 17:41:15,371 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 46 states. [2019-12-07 17:41:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:16,703 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-12-07 17:41:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:41:16,704 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-12-07 17:41:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:16,705 INFO L225 Difference]: With dead ends: 45 [2019-12-07 17:41:16,705 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 17:41:16,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 17:41:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 17:41:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-12-07 17:41:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 17:41:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-12-07 17:41:16,711 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 52 [2019-12-07 17:41:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:16,711 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-12-07 17:41:16,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 17:41:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-12-07 17:41:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 17:41:16,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:16,713 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:16,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:41:16,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:16,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1459073907, now seen corresponding path program 5 times [2019-12-07 17:41:16,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:16,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573761158] [2019-12-07 17:41:16,915 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:16,964 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-07 17:41:16,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:16,967 WARN L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 17:41:16,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 17:41:17,333 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:18,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:19,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:19,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:19,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:19,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:19,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:20,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:20,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:21,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:21,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:21,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 17:41:21,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573761158] [2019-12-07 17:41:21,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:21,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2019-12-07 17:41:21,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500515101] [2019-12-07 17:41:21,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 17:41:21,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:21,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 17:41:21,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 17:41:21,715 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 56 states. [2019-12-07 17:41:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:23,470 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-12-07 17:41:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 17:41:23,471 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 64 [2019-12-07 17:41:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:23,472 INFO L225 Difference]: With dead ends: 51 [2019-12-07 17:41:23,472 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 17:41:23,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2019-12-07 17:41:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 17:41:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 17:41:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 17:41:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-12-07 17:41:23,478 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 64 [2019-12-07 17:41:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:23,479 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-12-07 17:41:23,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 17:41:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-12-07 17:41:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 17:41:23,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:23,480 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:23,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:41:23,681 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1087630003, now seen corresponding path program 6 times [2019-12-07 17:41:23,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:23,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766232541] [2019-12-07 17:41:23,682 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:23,776 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-12-07 17:41:23,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:23,779 WARN L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 17:41:23,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 17:41:24,256 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:25,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:25,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:25,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:25,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:26,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:27,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:27,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:28,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:28,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:28,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:29,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:29,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:29,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:29,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:29,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:30,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 17:41:30,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766232541] [2019-12-07 17:41:30,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:30,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2019-12-07 17:41:30,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099855090] [2019-12-07 17:41:30,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-12-07 17:41:30,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:30,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-12-07 17:41:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 17:41:30,442 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 66 states. [2019-12-07 17:41:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:32,736 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-12-07 17:41:32,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 17:41:32,736 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 76 [2019-12-07 17:41:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:32,737 INFO L225 Difference]: With dead ends: 57 [2019-12-07 17:41:32,737 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 17:41:32,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2019-12-07 17:41:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 17:41:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 17:41:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 17:41:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-12-07 17:41:32,744 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 76 [2019-12-07 17:41:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:32,745 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-12-07 17:41:32,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-12-07 17:41:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-12-07 17:41:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:41:32,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:32,746 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:32,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:41:32,947 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1736651251, now seen corresponding path program 7 times [2019-12-07 17:41:32,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:32,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994187501] [2019-12-07 17:41:32,948 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/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:41:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:33,039 WARN L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 17:41:33,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-12-07 17:41:33,642 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:34,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:34,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:36,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:36,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:38,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:38,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:39,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:39,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:39,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:39,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:40,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:40,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:40,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:41,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:41,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 17:41:41,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994187501] [2019-12-07 17:41:41,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:41,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2019-12-07 17:41:41,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426171953] [2019-12-07 17:41:41,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-12-07 17:41:41,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-12-07 17:41:41,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 17:41:41,870 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-12-07 17:41:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:44,963 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-12-07 17:41:44,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 17:41:44,964 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 88 [2019-12-07 17:41:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:44,965 INFO L225 Difference]: With dead ends: 63 [2019-12-07 17:41:44,965 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 17:41:44,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2019-12-07 17:41:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 17:41:44,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 17:41:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 17:41:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-12-07 17:41:44,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 88 [2019-12-07 17:41:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:44,974 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-12-07 17:41:44,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-12-07 17:41:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-12-07 17:41:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:41:44,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:44,975 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:45,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:41:45,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2110158541, now seen corresponding path program 8 times [2019-12-07 17:41:45,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:41:45,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223339511] [2019-12-07 17:41:45,177 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 17:41:45,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:41:45,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:41:45,287 WARN L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 17:41:45,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-12-07 17:41:46,036 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:41:47,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:47,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:49,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:49,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:50,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:50,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:50,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:51,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:51,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:52,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:52,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:53,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:53,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:54,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:54,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:54,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:55,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:55,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:55,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:56,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:56,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:56,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 17:41:56,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223339511] [2019-12-07 17:41:56,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:56,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2019-12-07 17:41:56,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974250951] [2019-12-07 17:41:56,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-12-07 17:41:56,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:41:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-12-07 17:41:56,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2019-12-07 17:41:56,811 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 86 states. [2019-12-07 17:42:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:00,257 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-12-07 17:42:00,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 17:42:00,258 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 100 [2019-12-07 17:42:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:00,259 INFO L225 Difference]: With dead ends: 69 [2019-12-07 17:42:00,259 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 17:42:00,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2019-12-07 17:42:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 17:42:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 17:42:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 17:42:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-12-07 17:42:00,265 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 100 [2019-12-07 17:42:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:00,266 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-12-07 17:42:00,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-12-07 17:42:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-12-07 17:42:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 17:42:00,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:00,267 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:00,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:42:00,468 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:00,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1898639475, now seen corresponding path program 9 times [2019-12-07 17:42:00,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:42:00,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180182395] [2019-12-07 17:42:00,469 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 17:42:00,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-07 17:42:00,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:42:00,632 WARN L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-07 17:42:00,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:42:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-12-07 17:42:01,536 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:42:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:03,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:04,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:04,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:04,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:06,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:07,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:08,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:08,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:08,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:10,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:10,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:11,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:11,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:12,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:12,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:13,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:13,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:14,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-12-07 17:42:14,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180182395] [2019-12-07 17:42:14,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:42:14,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2019-12-07 17:42:14,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677150519] [2019-12-07 17:42:14,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-12-07 17:42:14,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:42:14,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-12-07 17:42:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 17:42:14,708 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 96 states. [2019-12-07 17:42:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:20,886 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-12-07 17:42:20,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 17:42:20,887 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 112 [2019-12-07 17:42:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:20,888 INFO L225 Difference]: With dead ends: 75 [2019-12-07 17:42:20,888 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 17:42:20,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1274, Invalid=16816, Unknown=0, NotChecked=0, Total=18090 [2019-12-07 17:42:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 17:42:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 17:42:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 17:42:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-12-07 17:42:20,894 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 112 [2019-12-07 17:42:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:20,894 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-12-07 17:42:20,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-12-07 17:42:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-12-07 17:42:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 17:42:20,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:20,895 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:21,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:42:21,096 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2106288051, now seen corresponding path program 10 times [2019-12-07 17:42:21,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:42:21,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326156798] [2019-12-07 17:42:21,098 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 17:42:21,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:42:21,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:42:21,238 WARN L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-07 17:42:21,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:42:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-12-07 17:42:22,322 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:42:24,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:24,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:25,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:25,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:26,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:26,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:27,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:27,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:28,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:29,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:29,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:30,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:30,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:30,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:31,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:31,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:33,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:33,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:33,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:33,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:34,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:34,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:36,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 17:42:37,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326156798] [2019-12-07 17:42:37,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:42:37,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2019-12-07 17:42:37,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855960868] [2019-12-07 17:42:37,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-12-07 17:42:37,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:42:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-12-07 17:42:37,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 17:42:37,319 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 106 states. [2019-12-07 17:42:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:43,000 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-12-07 17:42:43,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-07 17:42:43,001 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 124 [2019-12-07 17:42:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:43,002 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:42:43,002 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 17:42:43,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 135 SyntacticMatches, 7 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2019-12-07 17:42:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 17:42:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 17:42:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 17:42:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-12-07 17:42:43,008 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 124 [2019-12-07 17:42:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:43,009 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-12-07 17:42:43,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-12-07 17:42:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-12-07 17:42:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 17:42:43,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:43,010 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:43,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 17:42:43,211 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1718685965, now seen corresponding path program 11 times [2019-12-07 17:42:43,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:42:43,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750098798] [2019-12-07 17:42:43,212 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 17:42:43,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-12-07 17:42:43,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:42:43,454 WARN L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-07 17:42:43,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:42:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-12-07 17:42:44,813 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:42:46,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:47,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:47,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:48,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:48,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:49,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:50,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:51,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:51,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:52,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:53,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:53,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:54,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:55,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:55,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:55,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:56,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:58,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:42:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:00,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:00,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:02,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:02,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:02,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-12-07 17:43:03,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750098798] [2019-12-07 17:43:03,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:43:03,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2019-12-07 17:43:03,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370269727] [2019-12-07 17:43:03,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-12-07 17:43:03,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:43:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-12-07 17:43:03,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2019-12-07 17:43:03,097 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 116 states. [2019-12-07 17:43:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:09,323 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-12-07 17:43:09,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 17:43:09,324 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 136 [2019-12-07 17:43:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:09,325 INFO L225 Difference]: With dead ends: 87 [2019-12-07 17:43:09,325 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 17:43:09,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 151 SyntacticMatches, 5 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2019-12-07 17:43:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 17:43:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-12-07 17:43:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 17:43:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-12-07 17:43:09,330 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 136 [2019-12-07 17:43:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:09,331 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-12-07 17:43:09,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-12-07 17:43:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-12-07 17:43:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 17:43:09,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:09,332 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:43:09,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 17:43:09,532 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:09,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:09,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1603697101, now seen corresponding path program 12 times [2019-12-07 17:43:09,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:43:09,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955677682] [2019-12-07 17:43:09,534 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 17:43:09,744 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-12-07 17:43:09,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:43:09,750 WARN L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 100 conjunts are in the unsatisfiable core [2019-12-07 17:43:09,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:43:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-12-07 17:43:11,221 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:43:14,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:15,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:15,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:17,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:17,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:18,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:20,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:21,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:22,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:24,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:24,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:25,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:25,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:26,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:26,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:28,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:29,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:29,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:30,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:30,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:30,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:33,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:34,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:35,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-12-07 17:43:35,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955677682] [2019-12-07 17:43:35,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:43:35,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2019-12-07 17:43:35,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74099708] [2019-12-07 17:43:35,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-12-07 17:43:35,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:43:35,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-12-07 17:43:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2019-12-07 17:43:35,617 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 126 states. [2019-12-07 17:43:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:43,338 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-12-07 17:43:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 17:43:43,339 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 148 [2019-12-07 17:43:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:43,340 INFO L225 Difference]: With dead ends: 93 [2019-12-07 17:43:43,340 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 17:43:43,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 166 SyntacticMatches, 4 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2019-12-07 17:43:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 17:43:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-12-07 17:43:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 17:43:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-12-07 17:43:43,345 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 148 [2019-12-07 17:43:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:43,345 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-12-07 17:43:43,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-12-07 17:43:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-12-07 17:43:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:43:43,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:43,347 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:43:43,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 17:43:43,548 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:43,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:43,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1773195917, now seen corresponding path program 13 times [2019-12-07 17:43:43,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:43:43,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57303230] [2019-12-07 17:43:43,549 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 17:43:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:43,721 WARN L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 108 conjunts are in the unsatisfiable core [2019-12-07 17:43:43,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:43:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-12-07 17:43:45,394 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:43:47,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:47,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:49,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:50,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:51,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:52,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:54,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:54,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:56,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:56,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:58,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:59,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:00,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:01,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:02,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:02,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:02,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:03,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:04,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:05,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:06,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:07,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:07,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:07,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:08,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:08,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:09,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:10,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-12-07 17:44:10,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57303230] [2019-12-07 17:44:10,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:10,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2019-12-07 17:44:10,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585269993] [2019-12-07 17:44:10,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-12-07 17:44:10,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:44:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-12-07 17:44:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2019-12-07 17:44:10,457 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 136 states. [2019-12-07 17:44:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:18,459 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-12-07 17:44:18,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 17:44:18,460 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 160 [2019-12-07 17:44:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:18,461 INFO L225 Difference]: With dead ends: 99 [2019-12-07 17:44:18,461 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 17:44:18,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 178 SyntacticMatches, 6 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2019-12-07 17:44:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 17:44:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-12-07 17:44:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 17:44:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-12-07 17:44:18,468 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 160 [2019-12-07 17:44:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:18,468 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-12-07 17:44:18,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-12-07 17:44:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-12-07 17:44:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 17:44:18,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:18,470 INFO L410 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:18,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 17:44:18,671 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:44:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash 395057997, now seen corresponding path program 14 times [2019-12-07 17:44:18,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:44:18,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411415569] [2019-12-07 17:44:18,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 17:44:18,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:44:18,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:44:18,910 WARN L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 116 conjunts are in the unsatisfiable core [2019-12-07 17:44:18,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-12-07 17:44:20,801 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:44:23,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:23,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:25,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:29,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:31,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:31,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:32,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:34,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:36,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:36,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:37,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:37,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:38,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:40,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:40,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:42,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:43,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:47,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:49,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:50,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:51,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:51,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:51,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:51,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:52,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-12-07 17:44:52,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411415569] [2019-12-07 17:44:52,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:52,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2019-12-07 17:44:52,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150304893] [2019-12-07 17:44:52,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-12-07 17:44:52,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:44:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-12-07 17:44:52,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2019-12-07 17:44:52,998 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 146 states. [2019-12-07 17:45:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:04,109 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-12-07 17:45:04,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-07 17:45:04,110 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 172 [2019-12-07 17:45:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:04,111 INFO L225 Difference]: With dead ends: 105 [2019-12-07 17:45:04,111 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 17:45:04,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2019-12-07 17:45:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 17:45:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 17:45:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 17:45:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-12-07 17:45:04,116 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 172 [2019-12-07 17:45:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:04,117 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-12-07 17:45:04,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-12-07 17:45:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-12-07 17:45:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 17:45:04,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:04,118 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:04,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 17:45:04,318 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1391744013, now seen corresponding path program 15 times [2019-12-07 17:45:04,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:04,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015794844] [2019-12-07 17:45:04,320 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:04,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-12-07 17:45:04,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:45:04,652 WARN L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 124 conjunts are in the unsatisfiable core [2019-12-07 17:45:04,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-12-07 17:45:06,782 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:10,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:10,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:12,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:16,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:20,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:20,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:22,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:22,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:23,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:24,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:25,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:26,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:26,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:28,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:29,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:29,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:30,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:31,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:33,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:33,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:36,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:37,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:38,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:38,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:40,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:41,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:41,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-12-07 17:45:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015794844] [2019-12-07 17:45:41,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:41,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2019-12-07 17:45:41,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928819809] [2019-12-07 17:45:41,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-12-07 17:45:41,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:41,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-12-07 17:45:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2019-12-07 17:45:41,858 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 156 states. [2019-12-07 17:45:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:54,538 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-12-07 17:45:54,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-07 17:45:54,538 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 184 [2019-12-07 17:45:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:54,539 INFO L225 Difference]: With dead ends: 111 [2019-12-07 17:45:54,539 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 17:45:54,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 206 SyntacticMatches, 6 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2019-12-07 17:45:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 17:45:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-12-07 17:45:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 17:45:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-12-07 17:45:54,545 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 184 [2019-12-07 17:45:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:54,545 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-12-07 17:45:54,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-12-07 17:45:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-12-07 17:45:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-07 17:45:54,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:54,546 INFO L410 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:54,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 17:45:54,747 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash 481656013, now seen corresponding path program 16 times [2019-12-07 17:45:54,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:54,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669144387] [2019-12-07 17:45:54,748 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:55,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:45:55,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-12-07 17:45:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:45:55,180 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 17:45:55,180 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:45:55,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:45:55,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:45:55 BoogieIcfgContainer [2019-12-07 17:45:55,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:45:55,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:45:55,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:45:55,436 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:45:55,437 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:04" (3/4) ... [2019-12-07 17:45:55,438 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:45:55,486 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0dfd650a-fc1a-4637-a206-c83251d88752/bin/uautomizer/witness.graphml [2019-12-07 17:45:55,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:45:55,488 INFO L168 Benchmark]: Toolchain (without parser) took 291432.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -92.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:55,488 INFO L168 Benchmark]: CDTParser took 0.13 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:45:55,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:55,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:55,489 INFO L168 Benchmark]: Boogie Preprocessor took 12.33 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:45:55,489 INFO L168 Benchmark]: RCFGBuilder took 146.16 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.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:55,489 INFO L168 Benchmark]: TraceAbstraction took 291026.25 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -8.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 375.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:55,490 INFO L168 Benchmark]: Witness Printer took 50.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:55,491 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.13 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 143.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.33 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 146.16 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.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 291026.25 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -8.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 375.0 MB. Max. memory is 11.5 GB. * Witness Printer took 50.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L25] int n = __VERIFIER_nondet_int(); [L26] COND FALSE !(n < 1) [L29] CALL, EXPR hanoi(n) VAL [\old(n)=32] [L17] COND FALSE !(n == 1) VAL [\old(n)=32, n=32] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=31] [L17] COND FALSE !(n == 1) VAL [\old(n)=31, n=31] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=30] [L17] COND FALSE !(n == 1) VAL [\old(n)=30, n=30] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=29] [L17] COND FALSE !(n == 1) VAL [\old(n)=29, n=29] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=28] [L17] COND FALSE !(n == 1) VAL [\old(n)=28, n=28] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=27] [L17] COND FALSE !(n == 1) VAL [\old(n)=27, n=27] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=26] [L17] COND FALSE !(n == 1) VAL [\old(n)=26, n=26] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=25] [L17] COND FALSE !(n == 1) VAL [\old(n)=25, n=25] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=24] [L17] COND FALSE !(n == 1) VAL [\old(n)=24, n=24] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=23] [L17] COND FALSE !(n == 1) VAL [\old(n)=23, n=23] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=22] [L17] COND FALSE !(n == 1) VAL [\old(n)=22, n=22] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=21] [L17] COND FALSE !(n == 1) VAL [\old(n)=21, n=21] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=20] [L17] COND FALSE !(n == 1) VAL [\old(n)=20, n=20] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=19] [L17] COND FALSE !(n == 1) VAL [\old(n)=19, n=19] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=18] [L17] COND FALSE !(n == 1) VAL [\old(n)=18, n=18] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=17] [L17] COND FALSE !(n == 1) VAL [\old(n)=17, n=17] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=16] [L17] COND FALSE !(n == 1) VAL [\old(n)=16, n=16] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=15] [L17] COND FALSE !(n == 1) VAL [\old(n)=15, n=15] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=14] [L17] COND FALSE !(n == 1) VAL [\old(n)=14, n=14] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=13] [L17] COND FALSE !(n == 1) VAL [\old(n)=13, n=13] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=12] [L17] COND FALSE !(n == 1) VAL [\old(n)=12, n=12] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=11] [L17] COND FALSE !(n == 1) VAL [\old(n)=11, n=11] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=10] [L17] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=9] [L17] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=2, hanoi(n-1)=1, n=2] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=3, hanoi(n-1)=3, n=3] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=4, hanoi(n-1)=7, n=4] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=5, hanoi(n-1)=15, n=5] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=6, hanoi(n-1)=31, n=6] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=7, hanoi(n-1)=63, n=7] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=8, hanoi(n-1)=127, n=8] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=9, hanoi(n-1)=255, n=9] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=10, hanoi(n-1)=511, n=10] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=11, hanoi(n-1)=1023, n=11] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=12, hanoi(n-1)=2047, n=12] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=13, hanoi(n-1)=4095, n=13] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=14, hanoi(n-1)=8191, n=14] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=15, hanoi(n-1)=16383, n=15] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=16, hanoi(n-1)=32767, n=16] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=17, hanoi(n-1)=65535, n=17] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=18, hanoi(n-1)=131071, n=18] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=19, hanoi(n-1)=262143, n=19] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=20, hanoi(n-1)=524287, n=20] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=21, hanoi(n-1)=1048575, n=21] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=22, hanoi(n-1)=2097151, n=22] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=23, hanoi(n-1)=4194303, n=23] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=24, hanoi(n-1)=8388607, n=24] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=25, hanoi(n-1)=16777215, n=25] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=26, hanoi(n-1)=33554431, n=26] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=27, hanoi(n-1)=67108863, n=27] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=28, hanoi(n-1)=134217727, n=28] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=29, hanoi(n-1)=268435455, n=29] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=30, hanoi(n-1)=536870911, n=30] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=31, hanoi(n-1)=1073741823, n=31] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=32, hanoi(n-1)=2147483647, n=32] [L20] return 2 * (hanoi(n-1)) + 1; [L29] RET, EXPR hanoi(n) [L29] unsigned result = hanoi(n); [L31] COND FALSE !(result+1>0 && result+1 == 1<