./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/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_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/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.25-f470102 [2019-12-07 17:48:09,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:48:09,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:48:09,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:48:09,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:48:09,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:48:09,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:48:09,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:48:09,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:48:09,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:48:09,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:48:09,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:48:09,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:48:09,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:48:09,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:48:09,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:48:09,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:48:09,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:48:09,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:48:09,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:48:09,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:48:09,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:48:09,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:48:09,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:48:09,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:48:09,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:48:09,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:48:09,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:48:09,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:48:09,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:48:09,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:48:09,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:48:09,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:48:09,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:48:09,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:48:09,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:48:09,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:48:09,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:48:09,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:48:09,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:48:09,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:48:09,271 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-12-07 17:48:09,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:48:09,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:48:09,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:48:09,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:48:09,282 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:48:09,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:48:09,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:48:09,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:48:09,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:48:09,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:48:09,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:48:09,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:48:09,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:48:09,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:48:09,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:48:09,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:48:09,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:48:09,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:48:09,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:48:09,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:48:09,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:48:09,285 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_25337e7a-83e8-4063-a3fd-5fb0d97c121a/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-12-07 17:48:09,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:48:09,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:48:09,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:48:09,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:48:09,400 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:48:09,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-12-07 17:48:09,440 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/data/08d5f5f44/9cfc6d0acf20451b93370cabbe9e68a5/FLAG2fbdfff64 [2019-12-07 17:48:09,839 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:48:09,840 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-12-07 17:48:09,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/data/08d5f5f44/9cfc6d0acf20451b93370cabbe9e68a5/FLAG2fbdfff64 [2019-12-07 17:48:09,852 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/data/08d5f5f44/9cfc6d0acf20451b93370cabbe9e68a5 [2019-12-07 17:48:09,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:48:09,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:48:09,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:48:09,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:48:09,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:48:09,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:48:09" (1/1) ... [2019-12-07 17:48:09,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8ebb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:09, skipping insertion in model container [2019-12-07 17:48:09,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:48:09" (1/1) ... [2019-12-07 17:48:09,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:48:09,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:48:09,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:48:09,974 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:48:10,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:48:10,029 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:48:10,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10 WrapperNode [2019-12-07 17:48:10,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:48:10,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:48:10,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:48:10,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:48:10,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:48:10,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:48:10,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:48:10,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:48:10,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... [2019-12-07 17:48:10,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:48:10,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:48:10,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:48:10,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:48:10,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:48:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:48:10,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:48:10,224 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:48:10,225 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:48:10,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:48:10 BoogieIcfgContainer [2019-12-07 17:48:10,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:48:10,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:48:10,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:48:10,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:48:10,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:48:09" (1/3) ... [2019-12-07 17:48:10,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f631bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:48:10, skipping insertion in model container [2019-12-07 17:48:10,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:10" (2/3) ... [2019-12-07 17:48:10,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f631bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:48:10, skipping insertion in model container [2019-12-07 17:48:10,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:48:10" (3/3) ... [2019-12-07 17:48:10,230 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-12-07 17:48:10,237 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:48:10,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-12-07 17:48:10,248 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-07 17:48:10,263 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:48:10,263 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:48:10,263 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:48:10,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:48:10,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:48:10,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:48:10,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:48:10,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:48:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-12-07 17:48:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:48:10,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:48:10,278 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-12-07 17:48:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2019-12-07 17:48:10,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202699129] [2019-12-07 17:48:10,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202699129] [2019-12-07 17:48:10,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:10,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:10,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756068116] [2019-12-07 17:48:10,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:48:10,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:48:10,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:48:10,386 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-12-07 17:48:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,398 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-12-07 17:48:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:48:10,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-07 17:48:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,405 INFO L225 Difference]: With dead ends: 50 [2019-12-07 17:48:10,405 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 17:48:10,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:48:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 17:48:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 17:48:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 17:48:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-12-07 17:48:10,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2019-12-07 17:48:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,429 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-12-07 17:48:10,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:48:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-12-07 17:48:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:48:10,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:48:10,430 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-12-07 17:48:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,430 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2019-12-07 17:48:10,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712376456] [2019-12-07 17:48:10,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712376456] [2019-12-07 17:48:10,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:10,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:10,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788425983] [2019-12-07 17:48:10,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:10,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:10,461 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-12-07 17:48:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,485 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-12-07 17:48:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:10,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:48:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,486 INFO L225 Difference]: With dead ends: 41 [2019-12-07 17:48:10,486 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 17:48:10,487 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-12-07 17:48:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 17:48:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-12-07 17:48:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 17:48:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-12-07 17:48:10,491 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-12-07 17:48:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,491 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-12-07 17:48:10,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-12-07 17:48:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:48:10,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:48:10,492 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-12-07 17:48:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-12-07 17:48:10,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312200977] [2019-12-07 17:48:10,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312200977] [2019-12-07 17:48:10,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:10,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:10,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210232268] [2019-12-07 17:48:10,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:10,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:10,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:10,511 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-12-07 17:48:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,528 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-12-07 17:48:10,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:10,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:48:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,530 INFO L225 Difference]: With dead ends: 34 [2019-12-07 17:48:10,530 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 17:48:10,530 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-12-07 17:48:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 17:48:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-12-07 17:48:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 17:48:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 17:48:10,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-12-07 17:48:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,536 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 17:48:10,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-12-07 17:48:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 17:48:10,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 17:48:10,537 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-12-07 17:48:10,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,537 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2019-12-07 17:48:10,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141264690] [2019-12-07 17:48:10,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141264690] [2019-12-07 17:48:10,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:10,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:10,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487238565] [2019-12-07 17:48:10,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:10,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:10,556 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-12-07 17:48:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,576 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-12-07 17:48:10,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:10,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 17:48:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,577 INFO L225 Difference]: With dead ends: 45 [2019-12-07 17:48:10,577 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 17:48:10,578 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-12-07 17:48:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 17:48:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-12-07 17:48:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 17:48:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-12-07 17:48:10,582 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-12-07 17:48:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,582 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-12-07 17:48:10,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-12-07 17:48:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 17:48:10,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 17:48:10,582 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-12-07 17:48:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-12-07 17:48:10,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339150326] [2019-12-07 17:48:10,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339150326] [2019-12-07 17:48:10,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:10,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:10,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976174342] [2019-12-07 17:48:10,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:10,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:10,601 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-12-07 17:48:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,613 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-12-07 17:48:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:10,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 17:48:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,614 INFO L225 Difference]: With dead ends: 31 [2019-12-07 17:48:10,614 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 17:48:10,614 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-12-07 17:48:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 17:48:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 17:48:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 17:48:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-12-07 17:48:10,618 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-12-07 17:48:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,618 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-12-07 17:48:10,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-12-07 17:48:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:48:10,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:10,619 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-12-07 17:48:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-12-07 17:48:10,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835765332] [2019-12-07 17:48:10,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835765332] [2019-12-07 17:48:10,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:10,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:48:10,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190486571] [2019-12-07 17:48:10,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:10,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:10,641 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-12-07 17:48:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,652 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-12-07 17:48:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:10,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 17:48:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,653 INFO L225 Difference]: With dead ends: 30 [2019-12-07 17:48:10,653 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 17:48:10,653 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-12-07 17:48:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 17:48:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 17:48:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 17:48:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-12-07 17:48:10,658 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-12-07 17:48:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,658 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-12-07 17:48:10,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-12-07 17:48:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 17:48:10,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:10,659 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-12-07 17:48:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-12-07 17:48:10,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184538766] [2019-12-07 17:48:10,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184538766] [2019-12-07 17:48:10,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:10,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:10,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312834427] [2019-12-07 17:48:10,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:10,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:10,677 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-12-07 17:48:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,684 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-12-07 17:48:10,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:10,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 17:48:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,685 INFO L225 Difference]: With dead ends: 29 [2019-12-07 17:48:10,685 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 17:48:10,686 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-12-07 17:48:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 17:48:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 17:48:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 17:48:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-12-07 17:48:10,689 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-12-07 17:48:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,690 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-12-07 17:48:10,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-12-07 17:48:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:48:10,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,690 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 17:48:10,691 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-12-07 17:48:10,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,691 INFO L82 PathProgramCache]: Analyzing trace with hash -52819969, now seen corresponding path program 1 times [2019-12-07 17:48:10,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626076439] [2019-12-07 17:48:10,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626076439] [2019-12-07 17:48:10,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732632932] [2019-12-07 17:48:10,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:10,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:48:10,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:10,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:10,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-12-07 17:48:10,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475636759] [2019-12-07 17:48:10,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:10,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:10,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:10,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:10,759 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-12-07 17:48:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:10,786 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-12-07 17:48:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:10,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 17:48:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:10,787 INFO L225 Difference]: With dead ends: 54 [2019-12-07 17:48:10,787 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 17:48:10,787 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-12-07 17:48:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 17:48:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-12-07 17:48:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 17:48:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-12-07 17:48:10,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2019-12-07 17:48:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:10,791 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-12-07 17:48:10,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-12-07 17:48:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:48:10,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:10,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:10,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:10,993 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-12-07 17:48:10,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-12-07 17:48:10,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:10,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049222423] [2019-12-07 17:48:10,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:11,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049222423] [2019-12-07 17:48:11,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:11,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:11,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983926488] [2019-12-07 17:48:11,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:11,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:11,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:11,055 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-12-07 17:48:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:11,138 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-12-07 17:48:11,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:11,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 17:48:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:11,139 INFO L225 Difference]: With dead ends: 64 [2019-12-07 17:48:11,139 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 17:48:11,139 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-12-07 17:48:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 17:48:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-12-07 17:48:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 17:48:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-12-07 17:48:11,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 10 [2019-12-07 17:48:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:11,144 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-12-07 17:48:11,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-12-07 17:48:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:48:11,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:11,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:11,145 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-12-07 17:48:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-12-07 17:48:11,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:11,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559576869] [2019-12-07 17:48:11,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:11,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559576869] [2019-12-07 17:48:11,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:11,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:11,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955813045] [2019-12-07 17:48:11,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:11,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:11,162 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-12-07 17:48:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:11,189 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-12-07 17:48:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:11,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:48:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:11,190 INFO L225 Difference]: With dead ends: 46 [2019-12-07 17:48:11,190 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 17:48:11,190 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-12-07 17:48:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 17:48:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-12-07 17:48:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 17:48:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-12-07 17:48:11,194 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2019-12-07 17:48:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:11,194 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-12-07 17:48:11,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-12-07 17:48:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:48:11,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:11,194 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:11,194 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-12-07 17:48:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-12-07 17:48:11,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:11,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7162404] [2019-12-07 17:48:11,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:11,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7162404] [2019-12-07 17:48:11,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927010712] [2019-12-07 17:48:11,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:11,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:48:11,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:11,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:11,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-12-07 17:48:11,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010362302] [2019-12-07 17:48:11,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:11,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:11,234 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2019-12-07 17:48:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:11,249 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-12-07 17:48:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:11,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 17:48:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:11,250 INFO L225 Difference]: With dead ends: 66 [2019-12-07 17:48:11,250 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 17:48:11,250 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-12-07 17:48:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 17:48:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-12-07 17:48:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 17:48:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-12-07 17:48:11,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2019-12-07 17:48:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:11,255 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-12-07 17:48:11,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-12-07 17:48:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:48:11,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:11,255 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-12-07 17:48:11,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:11,456 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-12-07 17:48:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1890502518, now seen corresponding path program 2 times [2019-12-07 17:48:11,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:11,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718449709] [2019-12-07 17:48:11,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:11,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718449709] [2019-12-07 17:48:11,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925550321] [2019-12-07 17:48:11,544 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:11,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 17:48:11,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:48:11,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:48:11,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:48:11,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:11,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2] total 6 [2019-12-07 17:48:11,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867754781] [2019-12-07 17:48:11,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:48:11,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:48:11,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:48:11,605 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 8 states. [2019-12-07 17:48:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:11,686 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-12-07 17:48:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:48:11,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-12-07 17:48:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:11,688 INFO L225 Difference]: With dead ends: 87 [2019-12-07 17:48:11,688 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 17:48:11,689 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-12-07 17:48:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 17:48:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2019-12-07 17:48:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 17:48:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-12-07 17:48:11,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2019-12-07 17:48:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:11,694 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-12-07 17:48:11,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:48:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-12-07 17:48:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:48:11,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:11,695 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:11,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:11,896 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-12-07 17:48:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash -575852389, now seen corresponding path program 1 times [2019-12-07 17:48:11,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:11,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449393452] [2019-12-07 17:48:11,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:48:11,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449393452] [2019-12-07 17:48:11,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:11,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:11,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431206852] [2019-12-07 17:48:11,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:11,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:11,932 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 4 states. [2019-12-07 17:48:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:11,959 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-12-07 17:48:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:11,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:48:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:11,961 INFO L225 Difference]: With dead ends: 48 [2019-12-07 17:48:11,961 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 17:48:11,962 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-12-07 17:48:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 17:48:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-12-07 17:48:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 17:48:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-12-07 17:48:11,968 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 14 [2019-12-07 17:48:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:11,968 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-12-07 17:48:11,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-12-07 17:48:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:48:11,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:11,969 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:11,969 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-12-07 17:48:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash 656583171, now seen corresponding path program 1 times [2019-12-07 17:48:11,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:11,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794594878] [2019-12-07 17:48:11,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:12,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794594878] [2019-12-07 17:48:12,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145788609] [2019-12-07 17:48:12,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:12,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:48:12,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:12,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:12,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-12-07 17:48:12,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439817967] [2019-12-07 17:48:12,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:48:12,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:48:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:48:12,056 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 11 states. [2019-12-07 17:48:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:12,293 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-12-07 17:48:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:48:12,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-12-07 17:48:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:12,294 INFO L225 Difference]: With dead ends: 113 [2019-12-07 17:48:12,294 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 17:48:12,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:48:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 17:48:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-12-07 17:48:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 17:48:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-12-07 17:48:12,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-12-07 17:48:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:12,299 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-12-07 17:48:12,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:48:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-12-07 17:48:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:48:12,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:12,299 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:12,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:12,501 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-12-07 17:48:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 471235363, now seen corresponding path program 1 times [2019-12-07 17:48:12,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:12,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908273522] [2019-12-07 17:48:12,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:12,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908273522] [2019-12-07 17:48:12,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533031337] [2019-12-07 17:48:12,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:12,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:48:12,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:12,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:12,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-07 17:48:12,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800824494] [2019-12-07 17:48:12,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:48:12,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:48:12,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:48:12,583 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2019-12-07 17:48:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:12,648 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-12-07 17:48:12,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:48:12,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 17:48:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:12,649 INFO L225 Difference]: With dead ends: 116 [2019-12-07 17:48:12,649 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 17:48:12,649 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-12-07 17:48:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 17:48:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2019-12-07 17:48:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 17:48:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-12-07 17:48:12,654 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 17 [2019-12-07 17:48:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:12,654 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-12-07 17:48:12,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:48:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-12-07 17:48:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:48:12,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:12,655 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-12-07 17:48:12,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:12,856 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-12-07 17:48:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash -415013654, now seen corresponding path program 2 times [2019-12-07 17:48:12,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:12,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064382615] [2019-12-07 17:48:12,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:12,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064382615] [2019-12-07 17:48:12,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614712976] [2019-12-07 17:48:12,904 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:12,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 17:48:12,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:48:12,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:48:12,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:48:12,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:12,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-12-07 17:48:12,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077369930] [2019-12-07 17:48:12,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:48:12,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:48:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:48:12,935 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 7 states. [2019-12-07 17:48:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:12,978 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2019-12-07 17:48:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:48:12,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 17:48:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:12,979 INFO L225 Difference]: With dead ends: 139 [2019-12-07 17:48:12,980 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 17:48:12,980 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-12-07 17:48:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 17:48:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 39. [2019-12-07 17:48:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 17:48:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-12-07 17:48:12,985 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2019-12-07 17:48:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:12,986 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-12-07 17:48:12,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:48:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-12-07 17:48:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:48:12,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:12,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:13,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:13,187 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-12-07 17:48:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2095953530, now seen corresponding path program 2 times [2019-12-07 17:48:13,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:13,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225740024] [2019-12-07 17:48:13,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:13,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225740024] [2019-12-07 17:48:13,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379233675] [2019-12-07 17:48:13,243 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:13,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:48:13,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:48:13,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:48:13,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:13,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:13,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-12-07 17:48:13,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970214646] [2019-12-07 17:48:13,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:48:13,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:13,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:48:13,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:48:13,271 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2019-12-07 17:48:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:13,345 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-12-07 17:48:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:48:13,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 17:48:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:13,346 INFO L225 Difference]: With dead ends: 92 [2019-12-07 17:48:13,346 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 17:48:13,346 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-12-07 17:48:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 17:48:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 44. [2019-12-07 17:48:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 17:48:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-12-07 17:48:13,350 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 22 [2019-12-07 17:48:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:13,350 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-12-07 17:48:13,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:48:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-12-07 17:48:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:48:13,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:13,351 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:13,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:13,552 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-12-07 17:48:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288067, now seen corresponding path program 3 times [2019-12-07 17:48:13,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:13,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432891569] [2019-12-07 17:48:13,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:13,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432891569] [2019-12-07 17:48:13,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314495995] [2019-12-07 17:48:13,644 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:13,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 17:48:13,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:48:13,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:48:13,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:48:13,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:13,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 11 [2019-12-07 17:48:13,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717193613] [2019-12-07 17:48:13,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:48:13,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:48:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:48:13,707 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-12-07 17:48:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:13,990 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-12-07 17:48:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:48:13,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-12-07 17:48:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:13,991 INFO L225 Difference]: With dead ends: 143 [2019-12-07 17:48:13,991 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 17:48:13,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=358, Invalid=698, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:48:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 17:48:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2019-12-07 17:48:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 17:48:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-12-07 17:48:13,997 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 27 [2019-12-07 17:48:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:13,997 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-12-07 17:48:13,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:48:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-12-07 17:48:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:48:13,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:13,998 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:14,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:14,199 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-12-07 17:48:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1685598945, now seen corresponding path program 1 times [2019-12-07 17:48:14,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:14,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270056203] [2019-12-07 17:48:14,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:48:14,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270056203] [2019-12-07 17:48:14,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358685853] [2019-12-07 17:48:14,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:14,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:48:14,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 17:48:14,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:48:14,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-12-07 17:48:14,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884922476] [2019-12-07 17:48:14,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:48:14,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:14,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:48:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:48:14,448 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2019-12-07 17:48:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:14,507 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2019-12-07 17:48:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:48:14,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 17:48:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:14,508 INFO L225 Difference]: With dead ends: 147 [2019-12-07 17:48:14,508 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 17:48:14,509 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-12-07 17:48:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 17:48:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-12-07 17:48:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 17:48:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-12-07 17:48:14,517 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 39 [2019-12-07 17:48:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:14,518 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-12-07 17:48:14,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:48:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-12-07 17:48:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:48:14,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:14,519 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:14,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:14,719 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-12-07 17:48:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1243466243, now seen corresponding path program 2 times [2019-12-07 17:48:14,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:14,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959414201] [2019-12-07 17:48:14,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:48:14,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959414201] [2019-12-07 17:48:14,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552950712] [2019-12-07 17:48:14,771 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:14,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:48:14,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:48:14,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:48:14,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:48:14,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:14,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-12-07 17:48:14,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704932690] [2019-12-07 17:48:14,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:48:14,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:14,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:48:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:48:14,802 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 10 states. [2019-12-07 17:48:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:14,929 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2019-12-07 17:48:14,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:48:14,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-12-07 17:48:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:14,931 INFO L225 Difference]: With dead ends: 142 [2019-12-07 17:48:14,931 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 17:48:14,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:48:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 17:48:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2019-12-07 17:48:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 17:48:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-12-07 17:48:14,937 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 39 [2019-12-07 17:48:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:14,937 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-12-07 17:48:14,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:48:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-12-07 17:48:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:48:14,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:14,938 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 17:48:15,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:15,139 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-12-07 17:48:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:15,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1165798321, now seen corresponding path program 3 times [2019-12-07 17:48:15,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:15,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034245332] [2019-12-07 17:48:15,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:48:15,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034245332] [2019-12-07 17:48:15,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396184406] [2019-12-07 17:48:15,189 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:15,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 17:48:15,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:48:15,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:48:15,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 17:48:15,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:15,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 13 [2019-12-07 17:48:15,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87378685] [2019-12-07 17:48:15,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:48:15,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:48:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:48:15,235 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 14 states. [2019-12-07 17:48:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:15,506 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2019-12-07 17:48:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:48:15,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-12-07 17:48:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:15,507 INFO L225 Difference]: With dead ends: 198 [2019-12-07 17:48:15,507 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:48:15,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:48:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:48:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:48:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:48:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:48:15,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-12-07 17:48:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:15,508 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:48:15,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:48:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:48:15,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:48:15,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:15,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:48:15,900 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2019-12-07 17:48:16,029 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2019-12-07 17:48:16,197 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 140 [2019-12-07 17:48:16,479 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 30 [2019-12-07 17:48:16,949 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 38 [2019-12-07 17:48:17,707 WARN L192 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 30 [2019-12-07 17:48:17,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-12-07 17:48:17,709 INFO L242 CegarLoopResult]: 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-12-07 17:48:17,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-12-07 17:48:17,709 INFO L249 CegarLoopResult]: At program point L36(lines 13 37) the Hoare annotation is: true [2019-12-07 17:48:17,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-12-07 17:48:17,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:48:17,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-12-07 17:48:17,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:48:17,709 INFO L246 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L242 CegarLoopResult]: 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-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L242 CegarLoopResult]: 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-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-12-07 17:48:17,710 INFO L246 CegarLoopResult]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-12-07 17:48:17,711 INFO L246 CegarLoopResult]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2019-12-07 17:48:17,711 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-12-07 17:48:17,711 INFO L246 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2019-12-07 17:48:17,711 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-12-07 17:48:17,711 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-12-07 17:48:17,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:48:17 BoogieIcfgContainer [2019-12-07 17:48:17,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:48:17,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:48:17,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:48:17,726 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:48:17,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:48:10" (3/4) ... [2019-12-07 17:48:17,729 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:48:17,736 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 17:48:17,736 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:48:17,768 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_25337e7a-83e8-4063-a3fd-5fb0d97c121a/bin/uautomizer/witness.graphml [2019-12-07 17:48:17,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:48:17,769 INFO L168 Benchmark]: Toolchain (without parser) took 7914.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 943.6 MB in the beginning and 836.4 MB in the end (delta: 107.2 MB). Peak memory consumption was 254.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:17,770 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:48:17,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:17,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:48:17,770 INFO L168 Benchmark]: Boogie Preprocessor took 12.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:48:17,771 INFO L168 Benchmark]: RCFGBuilder took 157.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:17,771 INFO L168 Benchmark]: TraceAbstraction took 7499.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 837.2 MB in the end (delta: 240.4 MB). Peak memory consumption was 288.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:17,771 INFO L168 Benchmark]: Witness Printer took 42.17 ms. Allocated memory is still 1.2 GB. Free memory was 837.2 MB in the beginning and 836.4 MB in the end (delta: 725.5 kB). Peak memory consumption was 725.5 kB. Max. memory is 11.5 GB. [2019-12-07 17:48:17,773 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 157.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7499.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 837.2 MB in the end (delta: 240.4 MB). Peak memory consumption was 288.3 MB. Max. memory is 11.5 GB. * Witness Printer took 42.17 ms. Allocated memory is still 1.2 GB. Free memory was 837.2 MB in the beginning and 836.4 MB in the end (delta: 725.5 kB). Peak memory consumption was 725.5 kB. 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: 5.4s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 321 SDtfs, 1164 SDslu, 557 SDs, 0 SdLazy, 985 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.1s 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.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1386672 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s 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...