./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:39:40,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:39:40,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:39:40,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:39:40,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:39:40,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:39:40,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:39:40,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:39:40,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:39:40,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:39:40,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:39:40,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:39:40,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:39:40,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:39:40,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:39:40,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:39:40,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:39:40,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:39:40,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:39:40,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:39:40,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:39:40,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:39:40,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:39:40,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:39:40,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:39:40,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:39:40,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:39:40,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:39:40,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:39:40,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:39:40,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:39:40,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:39:40,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:39:40,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:39:40,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:39:40,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:39:40,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:39:40,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:39:40,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:39:40,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:39:40,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:39:40,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-15 21:39:40,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:39:40,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:39:40,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:39:40,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:39:40,869 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:39:40,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:39:40,870 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:39:40,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:39:40,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:39:40,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:39:40,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:39:40,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:39:40,871 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 21:39:40,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:39:40,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:39:40,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:39:40,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:39:40,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:39:40,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:39:40,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:39:40,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:39:40,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:39:40,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:39:40,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:39:40,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:39:40,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:39:40,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:39:40,875 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_cdd069e0-217e-49a6-b0a1-82e6cae52710/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2019-11-15 21:39:40,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:39:40,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:39:40,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:39:40,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:39:40,913 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:39:40,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-15 21:39:40,962 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/data/fb979f481/c39741acdfa744c7a3cb14daff43834b/FLAG17e85f039 [2019-11-15 21:39:41,326 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:39:41,327 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-15 21:39:41,332 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/data/fb979f481/c39741acdfa744c7a3cb14daff43834b/FLAG17e85f039 [2019-11-15 21:39:41,343 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/data/fb979f481/c39741acdfa744c7a3cb14daff43834b [2019-11-15 21:39:41,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:39:41,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:39:41,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:39:41,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:39:41,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:39:41,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714c62d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41, skipping insertion in model container [2019-11-15 21:39:41,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,361 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:39:41,375 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:39:41,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:39:41,647 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:39:41,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:39:41,685 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:39:41,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41 WrapperNode [2019-11-15 21:39:41,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:39:41,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:39:41,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:39:41,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:39:41,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:39:41,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:39:41,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:39:41,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:39:41,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... [2019-11-15 21:39:41,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:39:41,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:39:41,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:39:41,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:39:41,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:39:41,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:39:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:39:42,039 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:39:42,039 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:39:42,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:39:42 BoogieIcfgContainer [2019-11-15 21:39:42,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:39:42,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:39:42,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:39:42,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:39:42,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:39:41" (1/3) ... [2019-11-15 21:39:42,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36728f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:39:42, skipping insertion in model container [2019-11-15 21:39:42,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:41" (2/3) ... [2019-11-15 21:39:42,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36728f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:39:42, skipping insertion in model container [2019-11-15 21:39:42,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:39:42" (3/3) ... [2019-11-15 21:39:42,047 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-15 21:39:42,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:39:42,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-15 21:39:42,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-15 21:39:42,089 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:39:42,089 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:39:42,089 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:39:42,089 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:39:42,090 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:39:42,090 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:39:42,090 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:39:42,090 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:39:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-15 21:39:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-15 21:39:42,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-15 21:39:42,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2019-11-15 21:39:42,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597297912] [2019-11-15 21:39:42,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597297912] [2019-11-15 21:39:42,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:42,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:39:42,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574485687] [2019-11-15 21:39:42,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 21:39:42,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:39:42,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:39:42,229 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-15 21:39:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,241 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-11-15 21:39:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:39:42,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-15 21:39:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,250 INFO L225 Difference]: With dead ends: 50 [2019-11-15 21:39:42,250 INFO L226 Difference]: Without dead ends: 22 [2019-11-15 21:39:42,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:39:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-15 21:39:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-15 21:39:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 21:39:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 21:39:42,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2019-11-15 21:39:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,278 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 21:39:42,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 21:39:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-15 21:39:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-15 21:39:42,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,279 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-15 21:39:42,280 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,280 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2019-11-15 21:39:42,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31530225] [2019-11-15 21:39:42,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31530225] [2019-11-15 21:39:42,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:42,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:39:42,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349532225] [2019-11-15 21:39:42,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:39:42,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:39:42,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,329 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-11-15 21:39:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,372 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-15 21:39:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:39:42,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-15 21:39:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,378 INFO L225 Difference]: With dead ends: 41 [2019-11-15 21:39:42,378 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 21:39:42,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 21:39:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-11-15 21:39:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 21:39:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-15 21:39:42,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-11-15 21:39:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,384 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-15 21:39:42,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:39:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-15 21:39:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-15 21:39:42,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-15 21:39:42,387 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-11-15 21:39:42,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254892761] [2019-11-15 21:39:42,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254892761] [2019-11-15 21:39:42,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:42,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:39:42,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235366947] [2019-11-15 21:39:42,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:39:42,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:39:42,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,426 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-11-15 21:39:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,453 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-11-15 21:39:42,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:39:42,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-15 21:39:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,454 INFO L225 Difference]: With dead ends: 34 [2019-11-15 21:39:42,454 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 21:39:42,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 21:39:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-15 21:39:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 21:39:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-15 21:39:42,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-11-15 21:39:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,460 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 21:39:42,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:39:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-15 21:39:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 21:39:42,460 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:39:42,461 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2019-11-15 21:39:42,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990399957] [2019-11-15 21:39:42,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990399957] [2019-11-15 21:39:42,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:42,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:39:42,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444469558] [2019-11-15 21:39:42,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:39:42,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:39:42,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,493 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-11-15 21:39:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,541 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-11-15 21:39:42,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:39:42,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-15 21:39:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,542 INFO L225 Difference]: With dead ends: 45 [2019-11-15 21:39:42,542 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 21:39:42,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 21:39:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-15 21:39:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 21:39:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-15 21:39:42,549 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-11-15 21:39:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,550 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-15 21:39:42,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:39:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-15 21:39:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 21:39:42,550 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,551 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:39:42,551 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-11-15 21:39:42,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875482481] [2019-11-15 21:39:42,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875482481] [2019-11-15 21:39:42,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:42,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:39:42,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677381752] [2019-11-15 21:39:42,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:39:42,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:39:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,601 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-11-15 21:39:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,616 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-15 21:39:42,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:39:42,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-15 21:39:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,617 INFO L225 Difference]: With dead ends: 31 [2019-11-15 21:39:42,617 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 21:39:42,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 21:39:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 21:39:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 21:39:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-15 21:39:42,623 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-11-15 21:39:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,623 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-15 21:39:42,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:39:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-15 21:39:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:39:42,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,624 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:42,625 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-11-15 21:39:42,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375302700] [2019-11-15 21:39:42,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375302700] [2019-11-15 21:39:42,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:42,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-15 21:39:42,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451065187] [2019-11-15 21:39:42,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:39:42,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:39:42,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,655 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-11-15 21:39:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,679 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-15 21:39:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:39:42,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-15 21:39:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,682 INFO L225 Difference]: With dead ends: 30 [2019-11-15 21:39:42,682 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 21:39:42,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 21:39:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-15 21:39:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 21:39:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-15 21:39:42,688 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-11-15 21:39:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,688 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-15 21:39:42,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:39:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-15 21:39:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 21:39:42,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,689 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:42,689 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-11-15 21:39:42,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010104317] [2019-11-15 21:39:42,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010104317] [2019-11-15 21:39:42,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:42,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:39:42,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438956376] [2019-11-15 21:39:42,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:39:42,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:39:42,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,725 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-11-15 21:39:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,737 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-15 21:39:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:39:42,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-15 21:39:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,738 INFO L225 Difference]: With dead ends: 29 [2019-11-15 21:39:42,738 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 21:39:42,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:39:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 21:39:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 21:39:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 21:39:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-15 21:39:42,745 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-11-15 21:39:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,745 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-15 21:39:42,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:39:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-15 21:39:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 21:39:42,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,746 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-15 21:39:42,746 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -52819969, now seen corresponding path program 1 times [2019-11-15 21:39:42,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:42,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337805401] [2019-11-15 21:39:42,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:42,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337805401] [2019-11-15 21:39:42,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815385033] [2019-11-15 21:39:42,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:42,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:39:42,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:42,865 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:42,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-15 21:39:42,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359968675] [2019-11-15 21:39:42,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:39:42,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:39:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:39:42,867 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-11-15 21:39:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:42,904 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-15 21:39:42,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:39:42,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-15 21:39:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:42,905 INFO L225 Difference]: With dead ends: 54 [2019-11-15 21:39:42,905 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 21:39:42,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:39:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 21:39:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-11-15 21:39:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 21:39:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-15 21:39:42,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2019-11-15 21:39:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:42,913 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 21:39:42,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:39:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-15 21:39:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:39:42,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:42,914 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:43,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:43,118 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-11-15 21:39:43,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:43,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379128360] [2019-11-15 21:39:43,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:43,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379128360] [2019-11-15 21:39:43,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:43,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:39:43,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274936380] [2019-11-15 21:39:43,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:39:43,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:39:43,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:39:43,164 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-11-15 21:39:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:43,294 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-11-15 21:39:43,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:39:43,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 21:39:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:43,295 INFO L225 Difference]: With dead ends: 64 [2019-11-15 21:39:43,295 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 21:39:43,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:39:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 21:39:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-15 21:39:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 21:39:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-15 21:39:43,303 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 10 [2019-11-15 21:39:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:43,303 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-15 21:39:43,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:39:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-15 21:39:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:39:43,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:43,306 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:43,307 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-11-15 21:39:43,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:43,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780223662] [2019-11-15 21:39:43,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:43,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780223662] [2019-11-15 21:39:43,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:43,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:39:43,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697178570] [2019-11-15 21:39:43,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:39:43,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:39:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:39:43,346 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-11-15 21:39:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:43,397 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-11-15 21:39:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:39:43,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 21:39:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:43,398 INFO L225 Difference]: With dead ends: 46 [2019-11-15 21:39:43,398 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 21:39:43,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:39:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 21:39:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-11-15 21:39:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 21:39:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-15 21:39:43,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2019-11-15 21:39:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:43,403 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-15 21:39:43,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:39:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-15 21:39:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:39:43,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:43,404 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:43,405 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-11-15 21:39:43,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:43,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612372181] [2019-11-15 21:39:43,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:43,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612372181] [2019-11-15 21:39:43,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726071625] [2019-11-15 21:39:43,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:43,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:39:43,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:43,491 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:43,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-15 21:39:43,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889826928] [2019-11-15 21:39:43,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:39:43,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:39:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:39:43,492 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2019-11-15 21:39:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:43,517 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-11-15 21:39:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:39:43,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 21:39:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:43,519 INFO L225 Difference]: With dead ends: 66 [2019-11-15 21:39:43,519 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 21:39:43,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:39:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 21:39:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-11-15 21:39:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 21:39:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-15 21:39:43,528 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2019-11-15 21:39:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:43,528 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-15 21:39:43,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:39:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-15 21:39:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:39:43,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:43,529 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-11-15 21:39:43,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:43,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1890502518, now seen corresponding path program 2 times [2019-11-15 21:39:43,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:43,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951675701] [2019-11-15 21:39:43,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:43,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:43,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951675701] [2019-11-15 21:39:43,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179632566] [2019-11-15 21:39:43,797 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:43,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 21:39:43,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:43,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:39:43,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:39:43,857 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:43,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2] total 6 [2019-11-15 21:39:43,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877330085] [2019-11-15 21:39:43,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:39:43,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:39:43,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:39:43,858 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 8 states. [2019-11-15 21:39:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:43,998 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-11-15 21:39:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:39:43,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-15 21:39:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:44,001 INFO L225 Difference]: With dead ends: 87 [2019-11-15 21:39:44,001 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 21:39:44,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:39:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 21:39:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2019-11-15 21:39:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 21:39:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-15 21:39:44,016 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2019-11-15 21:39:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:44,016 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-15 21:39:44,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:39:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-11-15 21:39:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 21:39:44,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:44,017 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:44,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:44,222 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash -575852389, now seen corresponding path program 1 times [2019-11-15 21:39:44,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:44,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372505360] [2019-11-15 21:39:44,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:44,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:39:44,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372505360] [2019-11-15 21:39:44,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:44,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:39:44,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000629353] [2019-11-15 21:39:44,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:39:44,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:44,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:39:44,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:39:44,271 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 4 states. [2019-11-15 21:39:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:44,305 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-11-15 21:39:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:39:44,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-15 21:39:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:44,307 INFO L225 Difference]: With dead ends: 48 [2019-11-15 21:39:44,307 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 21:39:44,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:39:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 21:39:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-15 21:39:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 21:39:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-11-15 21:39:44,319 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 14 [2019-11-15 21:39:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:44,319 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-15 21:39:44,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:39:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-11-15 21:39:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 21:39:44,321 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:44,322 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:44,322 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 656583171, now seen corresponding path program 1 times [2019-11-15 21:39:44,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:44,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443688130] [2019-11-15 21:39:44,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:44,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:44,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:44,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443688130] [2019-11-15 21:39:44,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800376679] [2019-11-15 21:39:44,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:44,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:39:44,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:44,502 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:44,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-15 21:39:44,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667092037] [2019-11-15 21:39:44,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:39:44,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:39:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:39:44,504 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 11 states. [2019-11-15 21:39:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:44,885 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-11-15 21:39:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:39:44,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-15 21:39:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:44,886 INFO L225 Difference]: With dead ends: 113 [2019-11-15 21:39:44,886 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 21:39:44,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:39:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 21:39:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-11-15 21:39:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 21:39:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-15 21:39:44,894 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-11-15 21:39:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:44,895 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 21:39:44,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:39:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-11-15 21:39:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 21:39:44,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:44,896 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:45,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:45,099 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash 471235363, now seen corresponding path program 1 times [2019-11-15 21:39:45,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:45,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127178713] [2019-11-15 21:39:45,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:45,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127178713] [2019-11-15 21:39:45,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042486298] [2019-11-15 21:39:45,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:39:45,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:45,203 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:45,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 21:39:45,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713827926] [2019-11-15 21:39:45,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:39:45,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:39:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:39:45,205 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2019-11-15 21:39:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:45,313 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-11-15 21:39:45,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:39:45,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-15 21:39:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:45,315 INFO L225 Difference]: With dead ends: 116 [2019-11-15 21:39:45,315 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 21:39:45,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:39:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 21:39:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2019-11-15 21:39:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 21:39:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-11-15 21:39:45,327 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 17 [2019-11-15 21:39:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:45,328 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-11-15 21:39:45,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:39:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-11-15 21:39:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:39:45,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:45,329 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 21:39:45,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:45,530 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash -415013654, now seen corresponding path program 2 times [2019-11-15 21:39:45,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:45,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192461714] [2019-11-15 21:39:45,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:45,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192461714] [2019-11-15 21:39:45,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62456637] [2019-11-15 21:39:45,571 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:45,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 21:39:45,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:45,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:39:45,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:39:45,626 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:45,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-11-15 21:39:45,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813845538] [2019-11-15 21:39:45,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:39:45,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:39:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:39:45,628 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 7 states. [2019-11-15 21:39:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:45,708 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2019-11-15 21:39:45,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:39:45,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-15 21:39:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:45,710 INFO L225 Difference]: With dead ends: 139 [2019-11-15 21:39:45,710 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 21:39:45,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:39:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 21:39:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 39. [2019-11-15 21:39:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 21:39:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-15 21:39:45,716 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2019-11-15 21:39:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:45,717 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-15 21:39:45,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:39:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-15 21:39:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:39:45,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:45,723 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:45,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:45,933 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2095953530, now seen corresponding path program 2 times [2019-11-15 21:39:45,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:45,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145629007] [2019-11-15 21:39:45,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:45,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145629007] [2019-11-15 21:39:45,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529238658] [2019-11-15 21:39:45,996 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:46,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:39:46,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:46,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:39:46,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:46,044 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:46,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-15 21:39:46,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42050328] [2019-11-15 21:39:46,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:39:46,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:46,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:39:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:39:46,047 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2019-11-15 21:39:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:46,195 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-11-15 21:39:46,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:39:46,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 21:39:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:46,197 INFO L225 Difference]: With dead ends: 92 [2019-11-15 21:39:46,197 INFO L226 Difference]: Without dead ends: 91 [2019-11-15 21:39:46,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:39:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-15 21:39:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 44. [2019-11-15 21:39:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 21:39:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-15 21:39:46,206 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 22 [2019-11-15 21:39:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:46,206 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-15 21:39:46,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:39:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-11-15 21:39:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:39:46,210 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:46,210 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:46,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:46,414 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:46,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288067, now seen corresponding path program 3 times [2019-11-15 21:39:46,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:46,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657890005] [2019-11-15 21:39:46,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:46,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:46,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:39:46,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657890005] [2019-11-15 21:39:46,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541328780] [2019-11-15 21:39:46,466 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:46,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 21:39:46,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:46,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:39:46,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:39:46,548 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:46,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 11 [2019-11-15 21:39:46,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795203266] [2019-11-15 21:39:46,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:39:46,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:39:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:39:46,550 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-11-15 21:39:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:47,069 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-11-15 21:39:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 21:39:47,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-15 21:39:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:47,070 INFO L225 Difference]: With dead ends: 143 [2019-11-15 21:39:47,071 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 21:39:47,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=698, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:39:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 21:39:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2019-11-15 21:39:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 21:39:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-15 21:39:47,085 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 27 [2019-11-15 21:39:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:47,086 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-15 21:39:47,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:39:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-15 21:39:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:39:47,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:47,089 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:47,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:47,298 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:47,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:47,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1685598945, now seen corresponding path program 1 times [2019-11-15 21:39:47,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:47,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902396853] [2019-11-15 21:39:47,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:47,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:47,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:39:47,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902396853] [2019-11-15 21:39:47,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798262630] [2019-11-15 21:39:47,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:39:47,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:39:47,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:39:47,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-11-15 21:39:47,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382154644] [2019-11-15 21:39:47,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:39:47,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:39:47,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:39:47,552 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2019-11-15 21:39:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:47,662 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2019-11-15 21:39:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:39:47,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-15 21:39:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:47,663 INFO L225 Difference]: With dead ends: 147 [2019-11-15 21:39:47,663 INFO L226 Difference]: Without dead ends: 102 [2019-11-15 21:39:47,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:39:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-15 21:39:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-11-15 21:39:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 21:39:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-11-15 21:39:47,696 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 39 [2019-11-15 21:39:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:47,696 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-11-15 21:39:47,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:39:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-11-15 21:39:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:39:47,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:47,697 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:47,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:47,901 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1243466243, now seen corresponding path program 2 times [2019-11-15 21:39:47,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:47,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315088650] [2019-11-15 21:39:47,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:47,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:47,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:39:47,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315088650] [2019-11-15 21:39:48,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016994065] [2019-11-15 21:39:48,000 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:48,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:39:48,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:48,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:39:48,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:39:48,058 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:48,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 21:39:48,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074674480] [2019-11-15 21:39:48,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:39:48,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:48,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:39:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:39:48,059 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 10 states. [2019-11-15 21:39:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:48,280 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2019-11-15 21:39:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:39:48,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-11-15 21:39:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:48,281 INFO L225 Difference]: With dead ends: 142 [2019-11-15 21:39:48,282 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 21:39:48,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:39:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 21:39:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2019-11-15 21:39:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 21:39:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-11-15 21:39:48,293 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 39 [2019-11-15 21:39:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:48,295 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-11-15 21:39:48,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:39:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-11-15 21:39:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:39:48,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:48,297 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 21:39:48,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:48,501 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:39:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1165798321, now seen corresponding path program 3 times [2019-11-15 21:39:48,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:48,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142302502] [2019-11-15 21:39:48,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:48,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:48,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:39:48,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142302502] [2019-11-15 21:39:48,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054159078] [2019-11-15 21:39:48,585 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:48,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 21:39:48,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:48,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:39:48,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:39:48,653 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:48,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 13 [2019-11-15 21:39:48,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223725769] [2019-11-15 21:39:48,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:39:48,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:39:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:39:48,654 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 14 states. [2019-11-15 21:39:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:49,119 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2019-11-15 21:39:49,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 21:39:49,120 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-11-15 21:39:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:49,120 INFO L225 Difference]: With dead ends: 198 [2019-11-15 21:39:49,120 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:39:49,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:39:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:39:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:39:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:39:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:39:49,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-15 21:39:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:49,122 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:39:49,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:39:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:39:49,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:39:49,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:49,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:39:49,533 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2019-11-15 21:39:49,789 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2019-11-15 21:39:50,055 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 140 [2019-11-15 21:39:50,449 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 30 [2019-11-15 21:39:51,131 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 38 [2019-11-15 21:39:51,738 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 30 [2019-11-15 21:39:51,741 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 0 ULTIMATE.start_main_~N~0)) (.cse2 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse3 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse0 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse4 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse5 (and .cse1 (<= 0 ULTIMATE.start_main_~j~0) .cse2 .cse3))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse2 .cse3) (and (and .cse0 (and .cse4 .cse5)) (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (and .cse4 .cse5 (<= ULTIMATE.start_main_~m~0 0) (<= ULTIMATE.start_main_~j~0 0))))) [2019-11-15 21:39:51,741 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-15 21:39:51,741 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L446 ceAbstractionStarter]: At program point L36(lines 13 37) the Hoare annotation is: true [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L439 ceAbstractionStarter]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (and (and (and (<= ULTIMATE.start_main_~n~0 2147483647) (and (<= 0 ULTIMATE.start_main_~N~0) (<= 0 ULTIMATE.start_main_~j~0)) (<= 0 ULTIMATE.start_main_~k~0) (<= 0 ULTIMATE.start_main_~i~0)) (<= ULTIMATE.start_main_~m~0 2147483647)) (<= ULTIMATE.start_main_~k~0 2147483646) (<= ULTIMATE.start_main_~N~0 2147483647)))) (or (and (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse0) (and (<= ULTIMATE.start_main_~i~0 0) .cse0))) [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 21:39:51,742 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L439 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse8 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse3 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= 0 ULTIMATE.start_main_~j~0)) (.cse9 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse5 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse6 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse2 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse0 (and .cse8 .cse3 .cse4 .cse9 .cse5 .cse6)) (.cse1 (<= ULTIMATE.start_main_~j~0 0)) (.cse7 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)))) (or (and .cse0 (<= ULTIMATE.start_main_~m~0 0) .cse1) (and (<= ULTIMATE.start_main_~i~0 0) .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) .cse7 (and .cse8 (<= 0 ULTIMATE.start_main_~k~0) .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~k~0 2147483646) .cse9 .cse6)) (and (and .cse2 (and .cse0 .cse1)) (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse7)))) [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-15 21:39:51,743 INFO L443 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-15 21:39:51,744 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-15 21:39:51,744 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-15 21:39:51,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:39:51 BoogieIcfgContainer [2019-11-15 21:39:51,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:39:51,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:39:51,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:39:51,764 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:39:51,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:39:42" (3/4) ... [2019-11-15 21:39:51,767 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:39:51,776 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 21:39:51,777 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:39:51,825 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cdd069e0-217e-49a6-b0a1-82e6cae52710/bin/uautomizer/witness.graphml [2019-11-15 21:39:51,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:39:51,827 INFO L168 Benchmark]: Toolchain (without parser) took 10481.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -209.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:39:51,827 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:39:51,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -240.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:39:51,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:39:51,828 INFO L168 Benchmark]: Boogie Preprocessor took 41.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:39:51,829 INFO L168 Benchmark]: RCFGBuilder took 270.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:39:51,829 INFO L168 Benchmark]: TraceAbstraction took 9721.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 30.4 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.6 MB). Peak memory consumption was 262.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:39:51,829 INFO L168 Benchmark]: Witness Printer took 62.30 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:39:51,831 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -240.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 270.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9721.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 30.4 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.6 MB). Peak memory consumption was 262.1 MB. Max. memory is 11.5 GB. * Witness Printer took 62.30 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((i <= 0 && m <= 2147483647) && 0 <= N) && n + i <= 2147483647) && N <= 2147483647) && 0 <= i) || (((m <= 2147483647 && n <= 2147483647 && ((0 <= N && 0 <= j) && N <= 2147483647) && 0 <= i) && N <= i) && N <= k + 1)) || (((n <= 2147483647 && ((0 <= N && 0 <= j) && N <= 2147483647) && 0 <= i) && m <= 0) && j <= 0) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((n <= 2147483647 && 0 <= N) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) && m <= 0) && j <= 0) || (((((((i <= 0 && m <= 2147483647) && 0 <= N) && j <= 0) && n + i <= 2147483647) && 0 <= j) && N <= 2147483647) && 0 <= i)) || ((N <= i + 1 && N <= k + 1) && ((((((n <= 2147483647 && 0 <= k) && m <= 2147483647) && 0 <= N) && 0 <= j) && k <= 2147483646) && i <= 2147483646) && 0 <= i)) || (((m <= 2147483647 && (((((n <= 2147483647 && 0 <= N) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) && j <= 0) && N <= i) && N <= k + 1) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((N <= i + 1 && N <= k + 1) && (((((n <= 2147483647 && 0 <= N && 0 <= j) && 0 <= k) && 0 <= i) && m <= 2147483647) && k <= 2147483646) && N <= 2147483647) || (i <= 0 && (((((n <= 2147483647 && 0 <= N && 0 <= j) && 0 <= k) && 0 <= i) && m <= 2147483647) && k <= 2147483646) && N <= 2147483647) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 8 error locations. Result: SAFE, OverallTime: 9.6s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 321 SDtfs, 1164 SDslu, 557 SDs, 0 SdLazy, 985 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 524 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 68 NumberOfFragments, 274 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3603530 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1386655 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 589 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 43409 SizeOfPredicates, 24 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 145/478 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...