./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-6b5699a [2019-11-25 08:53:54,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:54,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:54,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:54,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:54,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:54,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:54,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:54,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:54,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:54,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:54,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:54,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:54,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:54,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:54,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:54,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:54,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:54,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:54,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:54,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:54,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:54,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:54,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:54,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:54,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:54,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:54,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:54,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:54,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:54,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:54,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:54,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:54,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:54,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:54,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:54,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:54,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:54,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:54,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:54,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:54,626 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-25 08:53:54,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:54,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:54,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:54,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:54,660 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:54,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:54,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:53:54,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:53:54,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:54,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:54,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:54,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:54,661 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:53:54,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:54,662 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:54,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:54,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:54,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:54,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:54,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:54,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:54,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:54,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:54,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:54,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:53:54,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:53:54,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:54,666 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_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:54,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:54,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:54,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:54,840 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:54,846 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:54,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-25 08:53:54,903 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/data/d74015af0/8ee255ed1e09463ab8f3ef0fbd3eeaca/FLAG472fbc748 [2019-11-25 08:53:55,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:55,239 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-25 08:53:55,244 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/data/d74015af0/8ee255ed1e09463ab8f3ef0fbd3eeaca/FLAG472fbc748 [2019-11-25 08:53:55,612 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/data/d74015af0/8ee255ed1e09463ab8f3ef0fbd3eeaca [2019-11-25 08:53:55,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:55,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:55,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:55,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:55,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:55,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fba7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55, skipping insertion in model container [2019-11-25 08:53:55,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:55,645 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:55,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:55,781 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:53:55,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:55,872 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:53:55,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55 WrapperNode [2019-11-25 08:53:55,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:55,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:55,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:53:55,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:53:55,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:55,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:53:55,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:53:55,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:53:55,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:53:55,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:53:55,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:53:55,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:53:55,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:53:56,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:53:56,338 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:53:56,338 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:53:56,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:56 BoogieIcfgContainer [2019-11-25 08:53:56,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:53:56,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:53:56,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:53:56,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:53:56,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:53:55" (1/3) ... [2019-11-25 08:53:56,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427e907d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:56, skipping insertion in model container [2019-11-25 08:53:56,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (2/3) ... [2019-11-25 08:53:56,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427e907d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:56, skipping insertion in model container [2019-11-25 08:53:56,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:56" (3/3) ... [2019-11-25 08:53:56,347 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-25 08:53:56,355 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:53:56,360 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-25 08:53:56,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-25 08:53:56,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:53:56,389 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:53:56,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:53:56,389 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:53:56,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:53:56,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:53:56,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:53:56,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:53:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-25 08:53:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-25 08:53:56,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-25 08:53:56,409 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2019-11-25 08:53:56,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940309403] [2019-11-25 08:53:56,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,531 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-25 08:53:56,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940309403] [2019-11-25 08:53:56,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:56,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800151417] [2019-11-25 08:53:56,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:53:56,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:53:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:53:56,548 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-25 08:53:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:56,563 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-11-25 08:53:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:53:56,564 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-25 08:53:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:56,570 INFO L225 Difference]: With dead ends: 50 [2019-11-25 08:53:56,570 INFO L226 Difference]: Without dead ends: 22 [2019-11-25 08:53:56,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:53:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-25 08:53:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-25 08:53:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:53:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-25 08:53:56,602 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2019-11-25 08:53:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:56,603 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-25 08:53:56,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:53:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-25 08:53:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-25 08:53:56,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-25 08:53:56,604 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2019-11-25 08:53:56,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683484810] [2019-11-25 08:53:56,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,647 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-25 08:53:56,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683484810] [2019-11-25 08:53:56,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:56,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010873835] [2019-11-25 08:53:56,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:56,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:56,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,650 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-11-25 08:53:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:56,691 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-25 08:53:56,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:56,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-25 08:53:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:56,693 INFO L225 Difference]: With dead ends: 41 [2019-11-25 08:53:56,693 INFO L226 Difference]: Without dead ends: 40 [2019-11-25 08:53:56,693 INFO L630 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-25 08:53:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-25 08:53:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-11-25 08:53:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:53:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-25 08:53:56,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-11-25 08:53:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:56,699 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-25 08:53:56,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-25 08:53:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-25 08:53:56,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-25 08:53:56,700 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:56,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-11-25 08:53:56,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223485056] [2019-11-25 08:53:56,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,729 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-25 08:53:56,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223485056] [2019-11-25 08:53:56,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:56,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142392365] [2019-11-25 08:53:56,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:56,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:56,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,731 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-11-25 08:53:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:56,766 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-11-25 08:53:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:56,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-25 08:53:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:56,767 INFO L225 Difference]: With dead ends: 34 [2019-11-25 08:53:56,768 INFO L226 Difference]: Without dead ends: 33 [2019-11-25 08:53:56,768 INFO L630 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-25 08:53:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-25 08:53:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-25 08:53:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:53:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-25 08:53:56,774 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-11-25 08:53:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:56,774 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-25 08:53:56,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-25 08:53:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:53:56,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:53:56,775 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2019-11-25 08:53:56,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050313413] [2019-11-25 08:53:56,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,802 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-25 08:53:56,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050313413] [2019-11-25 08:53:56,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:56,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847933104] [2019-11-25 08:53:56,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:56,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,805 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-11-25 08:53:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:56,840 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-11-25 08:53:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:56,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-25 08:53:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:56,841 INFO L225 Difference]: With dead ends: 45 [2019-11-25 08:53:56,841 INFO L226 Difference]: Without dead ends: 44 [2019-11-25 08:53:56,842 INFO L630 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-25 08:53:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-25 08:53:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-25 08:53:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:53:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-25 08:53:56,848 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-11-25 08:53:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:56,848 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-25 08:53:56,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-25 08:53:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:53:56,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:53:56,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-11-25 08:53:56,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254109386] [2019-11-25 08:53:56,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,884 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-25 08:53:56,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254109386] [2019-11-25 08:53:56,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:56,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788078028] [2019-11-25 08:53:56,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:56,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,886 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-11-25 08:53:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:56,904 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-25 08:53:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:56,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-25 08:53:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:56,905 INFO L225 Difference]: With dead ends: 31 [2019-11-25 08:53:56,905 INFO L226 Difference]: Without dead ends: 30 [2019-11-25 08:53:56,906 INFO L630 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-25 08:53:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-25 08:53:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-25 08:53:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:53:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-25 08:53:56,911 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-11-25 08:53:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:56,912 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-25 08:53:56,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-25 08:53:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-25 08:53:56,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:56,913 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-11-25 08:53:56,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44371881] [2019-11-25 08:53:56,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,944 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-25 08:53:56,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44371881] [2019-11-25 08:53:56,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-25 08:53:56,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154069858] [2019-11-25 08:53:56,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:56,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,946 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-11-25 08:53:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:56,962 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-25 08:53:56,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:56,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-25 08:53:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:56,963 INFO L225 Difference]: With dead ends: 30 [2019-11-25 08:53:56,964 INFO L226 Difference]: Without dead ends: 29 [2019-11-25 08:53:56,964 INFO L630 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-25 08:53:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-25 08:53:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-25 08:53:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-25 08:53:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-25 08:53:56,970 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-11-25 08:53:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:56,970 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-25 08:53:56,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-25 08:53:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 08:53:56,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:56,971 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-11-25 08:53:56,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049212592] [2019-11-25 08:53:56,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,996 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-25 08:53:56,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049212592] [2019-11-25 08:53:56,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:56,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407504646] [2019-11-25 08:53:56,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:56,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,998 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-11-25 08:53:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,015 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-25 08:53:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:57,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-25 08:53:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,016 INFO L225 Difference]: With dead ends: 29 [2019-11-25 08:53:57,016 INFO L226 Difference]: Without dead ends: 28 [2019-11-25 08:53:57,017 INFO L630 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-25 08:53:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-25 08:53:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-25 08:53:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-25 08:53:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-25 08:53:57,024 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-11-25 08:53:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,025 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-25 08:53:57,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-25 08:53:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:53:57,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,026 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,026 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash -52819969, now seen corresponding path program 1 times [2019-11-25 08:53:57,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932586531] [2019-11-25 08:53:57,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,085 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-25 08:53:57,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932586531] [2019-11-25 08:53:57,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400021546] [2019-11-25 08:53:57,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:53:57,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:57,184 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-25 08:53:57,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:57,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-25 08:53:57,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647101846] [2019-11-25 08:53:57,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,186 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-11-25 08:53:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,286 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-25 08:53:57,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:57,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-25 08:53:57,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,288 INFO L225 Difference]: With dead ends: 54 [2019-11-25 08:53:57,288 INFO L226 Difference]: Without dead ends: 53 [2019-11-25 08:53:57,288 INFO L630 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-25 08:53:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-25 08:53:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-11-25 08:53:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:53:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-25 08:53:57,295 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2019-11-25 08:53:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,295 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-25 08:53:57,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-25 08:53:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:53:57,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:57,508 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-11-25 08:53:57,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003724508] [2019-11-25 08:53:57,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,548 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-25 08:53:57,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003724508] [2019-11-25 08:53:57,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:57,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015772067] [2019-11-25 08:53:57,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,550 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-11-25 08:53:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,652 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-11-25 08:53:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:53:57,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 08:53:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,654 INFO L225 Difference]: With dead ends: 64 [2019-11-25 08:53:57,654 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 08:53:57,655 INFO L630 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-25 08:53:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 08:53:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-25 08:53:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:53:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-25 08:53:57,666 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 10 [2019-11-25 08:53:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,667 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-25 08:53:57,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-25 08:53:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:53:57,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,668 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-11-25 08:53:57,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002222373] [2019-11-25 08:53:57,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,696 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-25 08:53:57,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002222373] [2019-11-25 08:53:57,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:57,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871807755] [2019-11-25 08:53:57,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,698 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-11-25 08:53:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,748 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-11-25 08:53:57,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:57,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-25 08:53:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,749 INFO L225 Difference]: With dead ends: 46 [2019-11-25 08:53:57,750 INFO L226 Difference]: Without dead ends: 44 [2019-11-25 08:53:57,750 INFO L630 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-25 08:53:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-25 08:53:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-11-25 08:53:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-25 08:53:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-25 08:53:57,756 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2019-11-25 08:53:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,756 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-25 08:53:57,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-25 08:53:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:53:57,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,757 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,757 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:57,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,757 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-11-25 08:53:57,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038984915] [2019-11-25 08:53:57,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,797 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-25 08:53:57,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038984915] [2019-11-25 08:53:57,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495422089] [2019-11-25 08:53:57,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:53:57,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:57,838 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-25 08:53:57,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:57,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-25 08:53:57,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479666561] [2019-11-25 08:53:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,840 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2019-11-25 08:53:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,883 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-11-25 08:53:57,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:57,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-25 08:53:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,888 INFO L225 Difference]: With dead ends: 66 [2019-11-25 08:53:57,888 INFO L226 Difference]: Without dead ends: 65 [2019-11-25 08:53:57,889 INFO L630 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-25 08:53:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-25 08:53:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-11-25 08:53:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 08:53:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-25 08:53:57,902 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2019-11-25 08:53:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,902 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-25 08:53:57,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-25 08:53:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 08:53:57,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,904 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-11-25 08:53:58,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:58,108 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1890502518, now seen corresponding path program 2 times [2019-11-25 08:53:58,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964977974] [2019-11-25 08:53:58,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,184 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-25 08:53:58,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964977974] [2019-11-25 08:53:58,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46350420] [2019-11-25 08:53:58,185 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:58,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 08:53:58,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:53:58,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:53:58,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:58,243 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-25 08:53:58,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:58,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2] total 6 [2019-11-25 08:53:58,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641813918] [2019-11-25 08:53:58,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:53:58,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:53:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:58,245 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 8 states. [2019-11-25 08:53:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:58,397 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-11-25 08:53:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:53:58,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-25 08:53:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:58,402 INFO L225 Difference]: With dead ends: 87 [2019-11-25 08:53:58,402 INFO L226 Difference]: Without dead ends: 86 [2019-11-25 08:53:58,402 INFO L630 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-25 08:53:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-25 08:53:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2019-11-25 08:53:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-25 08:53:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-25 08:53:58,419 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2019-11-25 08:53:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,419 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-25 08:53:58,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:53:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-11-25 08:53:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:53:58,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,420 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:58,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:58,635 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash -575852389, now seen corresponding path program 1 times [2019-11-25 08:53:58,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422662056] [2019-11-25 08:53:58,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,675 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-25 08:53:58,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422662056] [2019-11-25 08:53:58,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:58,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:58,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372667072] [2019-11-25 08:53:58,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:58,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:58,677 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 4 states. [2019-11-25 08:53:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:58,703 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-11-25 08:53:58,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:58,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:53:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:58,705 INFO L225 Difference]: With dead ends: 48 [2019-11-25 08:53:58,705 INFO L226 Difference]: Without dead ends: 47 [2019-11-25 08:53:58,705 INFO L630 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-25 08:53:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-25 08:53:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-25 08:53:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-25 08:53:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-11-25 08:53:58,712 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 14 [2019-11-25 08:53:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,712 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-25 08:53:58,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-11-25 08:53:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:53:58,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,713 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:58,714 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash 656583171, now seen corresponding path program 1 times [2019-11-25 08:53:58,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664015194] [2019-11-25 08:53:58,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,795 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-25 08:53:58,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664015194] [2019-11-25 08:53:58,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211463679] [2019-11-25 08:53:58,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:53:58,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:58,879 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-25 08:53:58,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:58,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-25 08:53:58,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311649574] [2019-11-25 08:53:58,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 08:53:58,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:53:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:53:58,881 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 11 states. [2019-11-25 08:53:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:59,272 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-11-25 08:53:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 08:53:59,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-25 08:53:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:59,274 INFO L225 Difference]: With dead ends: 113 [2019-11-25 08:53:59,274 INFO L226 Difference]: Without dead ends: 67 [2019-11-25 08:53:59,275 INFO L630 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-25 08:53:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-25 08:53:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-11-25 08:53:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-25 08:53:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-25 08:53:59,288 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-11-25 08:53:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:59,288 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-25 08:53:59,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 08:53:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-11-25 08:53:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:53:59,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:59,292 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:59,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:59,495 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash 471235363, now seen corresponding path program 1 times [2019-11-25 08:53:59,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:59,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469138521] [2019-11-25 08:53:59,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:59,533 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-25 08:53:59,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469138521] [2019-11-25 08:53:59,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35663112] [2019-11-25 08:53:59,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:59,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:53:59,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:59,569 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-25 08:53:59,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:59,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-25 08:53:59,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995931948] [2019-11-25 08:53:59,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:53:59,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:59,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:53:59,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:59,571 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2019-11-25 08:53:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:59,684 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-11-25 08:53:59,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:53:59,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-25 08:53:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:59,686 INFO L225 Difference]: With dead ends: 116 [2019-11-25 08:53:59,686 INFO L226 Difference]: Without dead ends: 115 [2019-11-25 08:53:59,687 INFO L630 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-25 08:53:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-25 08:53:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2019-11-25 08:53:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:53:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-11-25 08:53:59,696 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 17 [2019-11-25 08:53:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:59,696 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-11-25 08:53:59,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:53:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-11-25 08:53:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:53:59,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:59,697 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-25 08:53:59,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:59,898 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash -415013654, now seen corresponding path program 2 times [2019-11-25 08:53:59,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:59,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142041808] [2019-11-25 08:53:59,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:59,936 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-25 08:53:59,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142041808] [2019-11-25 08:53:59,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975393937] [2019-11-25 08:53:59,937 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:53:59,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 08:53:59,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:53:59,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:53:59,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:59,994 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-25 08:53:59,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:59,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-11-25 08:53:59,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429813857] [2019-11-25 08:53:59,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:53:59,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:59,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:53:59,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:53:59,996 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 7 states. [2019-11-25 08:54:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:00,093 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2019-11-25 08:54:00,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:00,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-25 08:54:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:00,094 INFO L225 Difference]: With dead ends: 139 [2019-11-25 08:54:00,095 INFO L226 Difference]: Without dead ends: 138 [2019-11-25 08:54:00,095 INFO L630 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-25 08:54:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-25 08:54:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 39. [2019-11-25 08:54:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 08:54:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-25 08:54:00,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2019-11-25 08:54:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:00,102 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-25 08:54:00,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-25 08:54:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:54:00,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:00,103 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:00,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:00,316 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:54:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2095953530, now seen corresponding path program 2 times [2019-11-25 08:54:00,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:00,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789107849] [2019-11-25 08:54:00,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:00,373 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-25 08:54:00,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789107849] [2019-11-25 08:54:00,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917935418] [2019-11-25 08:54:00,373 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:54:00,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:54:00,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:00,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:54:00,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:00,407 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-25 08:54:00,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:00,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-25 08:54:00,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413913459] [2019-11-25 08:54:00,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:54:00,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:00,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:00,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:00,408 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2019-11-25 08:54:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:00,550 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-11-25 08:54:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:54:00,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-25 08:54:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:00,551 INFO L225 Difference]: With dead ends: 92 [2019-11-25 08:54:00,551 INFO L226 Difference]: Without dead ends: 91 [2019-11-25 08:54:00,551 INFO L630 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-25 08:54:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-25 08:54:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 44. [2019-11-25 08:54:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-25 08:54:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-25 08:54:00,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 22 [2019-11-25 08:54:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:00,558 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-25 08:54:00,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-11-25 08:54:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:54:00,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:00,559 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:00,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:00,763 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:54:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288067, now seen corresponding path program 3 times [2019-11-25 08:54:00,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:00,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793380734] [2019-11-25 08:54:00,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:00,813 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-25 08:54:00,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793380734] [2019-11-25 08:54:00,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868195172] [2019-11-25 08:54:00,813 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:54:00,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-25 08:54:00,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:00,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:54:00,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:00,900 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-25 08:54:00,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:00,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 11 [2019-11-25 08:54:00,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613796510] [2019-11-25 08:54:00,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:54:00,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:54:00,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:54:00,901 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-11-25 08:54:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:01,425 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-11-25 08:54:01,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-25 08:54:01,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-25 08:54:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:01,427 INFO L225 Difference]: With dead ends: 143 [2019-11-25 08:54:01,427 INFO L226 Difference]: Without dead ends: 142 [2019-11-25 08:54:01,428 INFO L630 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-25 08:54:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-25 08:54:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2019-11-25 08:54:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 08:54:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-25 08:54:01,435 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 27 [2019-11-25 08:54:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:01,437 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-25 08:54:01,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:54:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-25 08:54:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:54:01,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:01,441 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:01,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:01,644 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:54:01,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1685598945, now seen corresponding path program 1 times [2019-11-25 08:54:01,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:01,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995372951] [2019-11-25 08:54:01,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:01,759 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-25 08:54:01,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995372951] [2019-11-25 08:54:01,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577558843] [2019-11-25 08:54:01,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:54:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:01,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:54:01,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:01,856 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-25 08:54:01,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:01,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-11-25 08:54:01,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273294277] [2019-11-25 08:54:01,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:54:01,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:01,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:01,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:54:01,858 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2019-11-25 08:54:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:01,968 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2019-11-25 08:54:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:54:01,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-25 08:54:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:01,970 INFO L225 Difference]: With dead ends: 147 [2019-11-25 08:54:01,970 INFO L226 Difference]: Without dead ends: 102 [2019-11-25 08:54:01,971 INFO L630 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-25 08:54:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-25 08:54:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-11-25 08:54:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 08:54:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-11-25 08:54:01,979 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 39 [2019-11-25 08:54:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:01,980 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-11-25 08:54:01,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:54:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-11-25 08:54:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:54:01,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:01,981 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:02,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:02,192 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:54:02,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:02,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1243466243, now seen corresponding path program 2 times [2019-11-25 08:54:02,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:02,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769021256] [2019-11-25 08:54:02,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:02,286 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-25 08:54:02,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769021256] [2019-11-25 08:54:02,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248967947] [2019-11-25 08:54:02,287 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:54:02,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:54:02,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:02,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:54:02,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:02,322 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-25 08:54:02,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:02,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-25 08:54:02,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228053331] [2019-11-25 08:54:02,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:54:02,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:54:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:54:02,324 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 10 states. [2019-11-25 08:54:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:02,521 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2019-11-25 08:54:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:54:02,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-11-25 08:54:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:02,522 INFO L225 Difference]: With dead ends: 142 [2019-11-25 08:54:02,522 INFO L226 Difference]: Without dead ends: 141 [2019-11-25 08:54:02,523 INFO L630 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-25 08:54:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-25 08:54:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2019-11-25 08:54:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-25 08:54:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-11-25 08:54:02,534 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 39 [2019-11-25 08:54:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:02,534 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-11-25 08:54:02,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:54:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-11-25 08:54:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:54:02,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:02,535 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-25 08:54:02,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:02,747 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:54:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1165798321, now seen corresponding path program 3 times [2019-11-25 08:54:02,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:02,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820654417] [2019-11-25 08:54:02,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:02,831 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-25 08:54:02,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820654417] [2019-11-25 08:54:02,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811880539] [2019-11-25 08:54:02,832 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/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-25 08:54:02,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-25 08:54:02,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:02,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:54:02,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:02,904 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-25 08:54:02,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:02,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 13 [2019-11-25 08:54:02,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376621773] [2019-11-25 08:54:02,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:54:02,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:02,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:54:02,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:54:02,906 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 14 states. [2019-11-25 08:54:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:03,436 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2019-11-25 08:54:03,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-25 08:54:03,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-11-25 08:54:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:03,436 INFO L225 Difference]: With dead ends: 198 [2019-11-25 08:54:03,437 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:54:03,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-11-25 08:54:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:54:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:54:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:54:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:54:03,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-25 08:54:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:03,439 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:54:03,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:54:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:54:03,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:54:03,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:03,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:54:03,851 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2019-11-25 08:54:04,079 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2019-11-25 08:54:04,331 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 140 [2019-11-25 08:54:04,729 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 30 [2019-11-25 08:54:05,474 WARN L192 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 38 [2019-11-25 08:54:06,080 WARN L192 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 30 [2019-11-25 08:54:06,083 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-25 08:54:06,083 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse3 (<= 0 ULTIMATE.start_main_~j~0)) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse5 (<= 0 ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse3 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_main_~m~0 0) .cse2 (<= ULTIMATE.start_main_~j~0 0) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_main_~i~0 0) .cse1 .cse2 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse4 .cse5))) [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-25 08:54:06,084 INFO L447 ceAbstractionStarter]: At program point L36(lines 13 37) the Hoare annotation is: true [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-11-25 08:54:06,084 INFO L440 ceAbstractionStarter]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~k~0)) (.cse3 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= 0 ULTIMATE.start_main_~j~0)) (.cse5 (<= ULTIMATE.start_main_~k~0 2147483646)) (.cse6 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse7 (<= 0 ULTIMATE.start_main_~i~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse4 .cse5 .cse6 .cse7))) [2019-11-25 08:54:06,084 INFO L444 ceAbstractionStarter]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L440 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse7 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (.cse6 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse1 (<= 0 ULTIMATE.start_main_~N~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 0)) (.cse3 (<= 0 ULTIMATE.start_main_~j~0)) (.cse8 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse4 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse5 (<= 0 ULTIMATE.start_main_~i~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse3 .cse4 .cse5) (and .cse6 (<= 0 ULTIMATE.start_main_~k~0) .cse0 .cse1 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) .cse7 .cse3 (<= ULTIMATE.start_main_~k~0 2147483646) .cse8 .cse5) (and .cse6 .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse7 .cse3 .cse8 .cse4 .cse5) (and .cse6 (<= ULTIMATE.start_main_~m~0 0) .cse1 .cse2 .cse3 .cse8 .cse4 .cse5))) [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-11-25 08:54:06,085 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-11-25 08:54:06,086 INFO L444 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2019-11-25 08:54:06,086 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-25 08:54:06,086 INFO L444 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-25 08:54:06,086 INFO L444 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-25 08:54:06,086 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-25 08:54:06,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:54:06 BoogieIcfgContainer [2019-11-25 08:54:06,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:54:06,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:54:06,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:54:06,121 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:54:06,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:56" (3/4) ... [2019-11-25 08:54:06,124 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:54:06,132 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:54:06,132 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:54:06,186 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f2783101-8088-4f38-af63-30b94025fac6/bin/uautomizer/witness.graphml [2019-11-25 08:54:06,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:54:06,188 INFO L168 Benchmark]: Toolchain (without parser) took 10572.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 950.1 MB in the beginning and 1.3 GB in the end (delta: -333.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:54:06,188 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:54:06,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -215.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:06,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.26 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:06,189 INFO L168 Benchmark]: Boogie Preprocessor took 20.04 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:06,190 INFO L168 Benchmark]: RCFGBuilder took 411.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:06,190 INFO L168 Benchmark]: TraceAbstraction took 9780.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.7 MB). Peak memory consumption was 404.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:06,191 INFO L168 Benchmark]: Witness Printer took 65.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:06,192 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -215.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.26 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.04 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 411.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9780.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.7 MB). Peak memory consumption was 404.8 MB. Max. memory is 11.5 GB. * Witness Printer took 65.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 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: 28]: 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && N <= i) && N <= k + 1) && 0 <= j) && N <= 2147483647) && 0 <= i) || ((((((n <= 2147483647 && m <= 0) && 0 <= N) && j <= 0) && 0 <= j) && N <= 2147483647) && 0 <= i)) || (((((i <= 0 && m <= 2147483647) && 0 <= N) && n + i <= 2147483647) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((i <= 0 && m <= 2147483647) && 0 <= N) && j <= 0) && n + i <= 2147483647) && 0 <= j) && N <= 2147483647) && 0 <= i) || (((((((((n <= 2147483647 && 0 <= k) && m <= 2147483647) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && i <= 2147483646) && 0 <= i)) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && j <= 0) && N <= i) && N <= k + 1) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i)) || (((((((n <= 2147483647 && m <= 0) && 0 <= N) && j <= 0) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((i <= 0 && n <= 2147483647) && m <= 2147483647) && 0 <= k) && 0 <= N) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= k) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) - 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.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 321 SDtfs, 1164 SDslu, 557 SDs, 0 SdLazy, 985 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s 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, 257 HoareAnnotationTreeSize, 4 FomulaSimplifications, 4319131 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1386672 FormulaSimplificationTreeSizeReductionInter, 1.7s 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...