./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/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_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:56:24,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:56:24,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:56:24,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:56:24,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:56:24,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:56:24,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:56:24,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:56:24,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:56:24,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:56:24,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:56:24,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:56:24,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:56:24,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:56:24,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:56:24,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:56:24,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:56:24,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:56:24,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:56:24,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:56:24,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:56:24,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:56:24,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:56:24,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:56:24,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:56:24,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:56:24,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:56:24,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:56:24,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:56:24,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:56:24,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:56:24,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:56:24,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:56:24,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:56:24,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:56:24,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:56:24,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:56:24,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:56:24,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:56:24,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:56:24,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:56:24,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-20 03:56:24,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:56:24,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:56:24,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:56:24,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:56:24,299 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:56:24,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:56:24,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:56:24,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:56:24,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:56:24,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:56:24,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:56:24,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:56:24,301 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-20 03:56:24,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:56:24,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:56:24,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:56:24,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:56:24,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:56:24,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:56:24,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:56:24,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:56:24,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:56:24,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:56:24,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:56:24,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:56:24,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:56:24,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:56:24,305 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_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2019-11-20 03:56:24,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:56:24,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:56:24,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:56:24,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:56:24,511 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:56:24,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-20 03:56:24,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/data/6ebdf2d2e/76fb5beaa62247c294975e0fd1487d62/FLAG837bd2bea [2019-11-20 03:56:25,132 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:56:25,133 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-20 03:56:25,140 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/data/6ebdf2d2e/76fb5beaa62247c294975e0fd1487d62/FLAG837bd2bea [2019-11-20 03:56:25,562 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/data/6ebdf2d2e/76fb5beaa62247c294975e0fd1487d62 [2019-11-20 03:56:25,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:56:25,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:56:25,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:56:25,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:56:25,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:56:25,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6751d733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25, skipping insertion in model container [2019-11-20 03:56:25,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,586 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:56:25,603 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:56:25,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:56:25,783 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:56:25,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:56:25,887 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:56:25,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25 WrapperNode [2019-11-20 03:56:25,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:56:25,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:56:25,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:56:25,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:56:25,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:56:25,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:56:25,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:56:25,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:56:25,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... [2019-11-20 03:56:25,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:56:25,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:56:25,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:56:25,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:56:25,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:56:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:56:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:56:26,254 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:56:26,254 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:56:26,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:56:26 BoogieIcfgContainer [2019-11-20 03:56:26,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:56:26,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:56:26,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:56:26,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:56:26,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:56:25" (1/3) ... [2019-11-20 03:56:26,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c2315a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:56:26, skipping insertion in model container [2019-11-20 03:56:26,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:25" (2/3) ... [2019-11-20 03:56:26,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c2315a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:56:26, skipping insertion in model container [2019-11-20 03:56:26,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:56:26" (3/3) ... [2019-11-20 03:56:26,282 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-20 03:56:26,293 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:56:26,302 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-20 03:56:26,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-20 03:56:26,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:56:26,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:56:26,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:56:26,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:56:26,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:56:26,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:56:26,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:56:26,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:56:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-20 03:56:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 03:56:26,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:26,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 03:56:26,390 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:26,397 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2019-11-20 03:56:26,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:26,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490205928] [2019-11-20 03:56:26,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:26,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490205928] [2019-11-20 03:56:26,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:26,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:56:26,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254868874] [2019-11-20 03:56:26,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 03:56:26,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 03:56:26,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 03:56:26,576 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-20 03:56:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:26,601 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-11-20 03:56:26,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 03:56:26,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-20 03:56:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:26,615 INFO L225 Difference]: With dead ends: 50 [2019-11-20 03:56:26,616 INFO L226 Difference]: Without dead ends: 22 [2019-11-20 03:56:26,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 03:56:26,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-20 03:56:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-20 03:56:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 03:56:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-20 03:56:26,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2019-11-20 03:56:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:26,666 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-20 03:56:26,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 03:56:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-20 03:56:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 03:56:26,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:26,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 03:56:26,668 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2019-11-20 03:56:26,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:26,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674315844] [2019-11-20 03:56:26,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:26,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674315844] [2019-11-20 03:56:26,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:26,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:56:26,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603150798] [2019-11-20 03:56:26,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:26,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:26,731 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-11-20 03:56:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:26,789 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-20 03:56:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:26,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-20 03:56:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:26,791 INFO L225 Difference]: With dead ends: 41 [2019-11-20 03:56:26,791 INFO L226 Difference]: Without dead ends: 40 [2019-11-20 03:56:26,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-20 03:56:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-11-20 03:56:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 03:56:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-20 03:56:26,801 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-11-20 03:56:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:26,802 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-20 03:56:26,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-20 03:56:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 03:56:26,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:26,803 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 03:56:26,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:26,804 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-11-20 03:56:26,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:26,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535685102] [2019-11-20 03:56:26,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:26,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535685102] [2019-11-20 03:56:26,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:26,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:56:26,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811547617] [2019-11-20 03:56:26,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:26,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:26,854 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-11-20 03:56:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:26,902 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-11-20 03:56:26,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:26,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-20 03:56:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:26,904 INFO L225 Difference]: With dead ends: 34 [2019-11-20 03:56:26,904 INFO L226 Difference]: Without dead ends: 33 [2019-11-20 03:56:26,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-20 03:56:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-20 03:56:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 03:56:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-20 03:56:26,913 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-11-20 03:56:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:26,913 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-20 03:56:26,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-20 03:56:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 03:56:26,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:26,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 03:56:26,915 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2019-11-20 03:56:26,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:26,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118278848] [2019-11-20 03:56:26,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:26,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118278848] [2019-11-20 03:56:26,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:26,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:56:26,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591515952] [2019-11-20 03:56:26,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:26,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:26,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:26,953 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-11-20 03:56:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:26,995 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-11-20 03:56:26,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:26,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-20 03:56:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:26,998 INFO L225 Difference]: With dead ends: 45 [2019-11-20 03:56:26,998 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 03:56:26,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 03:56:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-20 03:56:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 03:56:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-20 03:56:27,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-11-20 03:56:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,008 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-20 03:56:27,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-20 03:56:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 03:56:27,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,010 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:27,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-11-20 03:56:27,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:27,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021308558] [2019-11-20 03:56:27,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:27,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021308558] [2019-11-20 03:56:27,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:27,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:56:27,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264200447] [2019-11-20 03:56:27,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:27,043 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-11-20 03:56:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,090 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-20 03:56:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:27,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-20 03:56:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,093 INFO L225 Difference]: With dead ends: 31 [2019-11-20 03:56:27,093 INFO L226 Difference]: Without dead ends: 30 [2019-11-20 03:56:27,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-20 03:56:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-20 03:56:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 03:56:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-20 03:56:27,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-11-20 03:56:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,111 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-20 03:56:27,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-20 03:56:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 03:56:27,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,112 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-11-20 03:56:27,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:27,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696134412] [2019-11-20 03:56:27,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:27,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696134412] [2019-11-20 03:56:27,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:27,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-20 03:56:27,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117214889] [2019-11-20 03:56:27,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:27,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:27,174 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-11-20 03:56:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,191 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-20 03:56:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:27,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-20 03:56:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,193 INFO L225 Difference]: With dead ends: 30 [2019-11-20 03:56:27,193 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 03:56:27,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 03:56:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-20 03:56:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 03:56:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-20 03:56:27,200 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-11-20 03:56:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,200 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-20 03:56:27,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-20 03:56:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 03:56:27,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,202 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-11-20 03:56:27,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:27,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559154111] [2019-11-20 03:56:27,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:27,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559154111] [2019-11-20 03:56:27,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:27,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:56:27,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992713629] [2019-11-20 03:56:27,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:27,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:27,247 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-11-20 03:56:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,264 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-20 03:56:27,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:27,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-20 03:56:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,265 INFO L225 Difference]: With dead ends: 29 [2019-11-20 03:56:27,266 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 03:56:27,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 03:56:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 03:56:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 03:56:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-20 03:56:27,273 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-11-20 03:56:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,273 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-20 03:56:27,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-20 03:56:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 03:56:27,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,275 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,275 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash -52819969, now seen corresponding path program 1 times [2019-11-20 03:56:27,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:27,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180941119] [2019-11-20 03:56:27,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:27,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180941119] [2019-11-20 03:56:27,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916395009] [2019-11-20 03:56:27,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:56:27,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:27,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:27,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-20 03:56:27,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579235472] [2019-11-20 03:56:27,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:56:27,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:27,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:56:27,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:56:27,403 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-11-20 03:56:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,477 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-20 03:56:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:56:27,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 03:56:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,479 INFO L225 Difference]: With dead ends: 54 [2019-11-20 03:56:27,479 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 03:56:27,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:56:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 03:56:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-11-20 03:56:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 03:56:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-20 03:56:27,488 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2019-11-20 03:56:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,489 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-20 03:56:27,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:56:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-20 03:56:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:56:27,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:27,702 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:27,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,702 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-11-20 03:56:27,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:27,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406652579] [2019-11-20 03:56:27,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:27,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406652579] [2019-11-20 03:56:27,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:27,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:56:27,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559663382] [2019-11-20 03:56:27,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:56:27,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:27,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:56:27,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:56:27,757 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-11-20 03:56:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,881 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-11-20 03:56:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:56:27,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 03:56:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,882 INFO L225 Difference]: With dead ends: 64 [2019-11-20 03:56:27,883 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 03:56:27,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:56:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 03:56:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-20 03:56:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 03:56:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-20 03:56:27,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 10 [2019-11-20 03:56:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,893 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-20 03:56:27,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:56:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-20 03:56:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:56:27,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,894 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,895 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-11-20 03:56:27,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:27,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517593160] [2019-11-20 03:56:27,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:27,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517593160] [2019-11-20 03:56:27,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:27,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:56:27,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694343352] [2019-11-20 03:56:27,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:56:27,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:56:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:56:27,940 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-11-20 03:56:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,990 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-11-20 03:56:27,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:56:27,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 03:56:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,991 INFO L225 Difference]: With dead ends: 46 [2019-11-20 03:56:27,991 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 03:56:27,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:56:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 03:56:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-11-20 03:56:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 03:56:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-20 03:56:27,998 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2019-11-20 03:56:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,999 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-20 03:56:27,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:56:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-20 03:56:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:56:28,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:28,000 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:28,001 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-11-20 03:56:28,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:28,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348555522] [2019-11-20 03:56:28,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:28,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348555522] [2019-11-20 03:56:28,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217480931] [2019-11-20 03:56:28,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:28,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:56:28,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:28,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:28,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-20 03:56:28,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996310744] [2019-11-20 03:56:28,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:56:28,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:28,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:56:28,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:56:28,082 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2019-11-20 03:56:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:28,119 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-11-20 03:56:28,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:56:28,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-20 03:56:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:28,121 INFO L225 Difference]: With dead ends: 66 [2019-11-20 03:56:28,121 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 03:56:28,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:56:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 03:56:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-11-20 03:56:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 03:56:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-20 03:56:28,131 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2019-11-20 03:56:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:28,131 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-20 03:56:28,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:56:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-20 03:56:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 03:56:28,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:28,133 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-11-20 03:56:28,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:28,337 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1890502518, now seen corresponding path program 2 times [2019-11-20 03:56:28,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:28,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992847398] [2019-11-20 03:56:28,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:28,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992847398] [2019-11-20 03:56:28,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933406917] [2019-11-20 03:56:28,408 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:28,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 03:56:28,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:56:28,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:56:28,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:56:28,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:28,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2] total 6 [2019-11-20 03:56:28,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485582321] [2019-11-20 03:56:28,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:56:28,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:56:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:56:28,456 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 8 states. [2019-11-20 03:56:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:28,613 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-11-20 03:56:28,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:56:28,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-20 03:56:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:28,617 INFO L225 Difference]: With dead ends: 87 [2019-11-20 03:56:28,617 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 03:56:28,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:56:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 03:56:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2019-11-20 03:56:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 03:56:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-20 03:56:28,629 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2019-11-20 03:56:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:28,630 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-20 03:56:28,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:56:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-11-20 03:56:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:56:28,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:28,631 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:28,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:28,836 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:28,836 INFO L82 PathProgramCache]: Analyzing trace with hash -575852389, now seen corresponding path program 1 times [2019-11-20 03:56:28,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:28,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601799058] [2019-11-20 03:56:28,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:56:28,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601799058] [2019-11-20 03:56:28,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:28,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:56:28,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216945906] [2019-11-20 03:56:28,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:56:28,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:56:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:56:28,886 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 4 states. [2019-11-20 03:56:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:28,933 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-11-20 03:56:28,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:56:28,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 03:56:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:28,935 INFO L225 Difference]: With dead ends: 48 [2019-11-20 03:56:28,935 INFO L226 Difference]: Without dead ends: 47 [2019-11-20 03:56:28,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:56:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-20 03:56:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-20 03:56:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 03:56:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-11-20 03:56:28,950 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 14 [2019-11-20 03:56:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:28,951 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-20 03:56:28,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:56:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-11-20 03:56:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:56:28,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:28,953 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:28,953 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:28,954 INFO L82 PathProgramCache]: Analyzing trace with hash 656583171, now seen corresponding path program 1 times [2019-11-20 03:56:28,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:28,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501977889] [2019-11-20 03:56:28,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:29,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501977889] [2019-11-20 03:56:29,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382033774] [2019-11-20 03:56:29,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:29,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:56:29,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:29,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:29,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-20 03:56:29,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055507455] [2019-11-20 03:56:29,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 03:56:29,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:29,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 03:56:29,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:56:29,186 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 11 states. [2019-11-20 03:56:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:29,800 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-11-20 03:56:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 03:56:29,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-20 03:56:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:29,802 INFO L225 Difference]: With dead ends: 113 [2019-11-20 03:56:29,802 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 03:56:29,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-20 03:56:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 03:56:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-11-20 03:56:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 03:56:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-20 03:56:29,810 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-11-20 03:56:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:29,810 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-20 03:56:29,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 03:56:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-11-20 03:56:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:56:29,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:29,812 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:30,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:30,029 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash 471235363, now seen corresponding path program 1 times [2019-11-20 03:56:30,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:30,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988940400] [2019-11-20 03:56:30,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:30,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988940400] [2019-11-20 03:56:30,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800859184] [2019-11-20 03:56:30,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:30,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:56:30,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:30,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:30,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-20 03:56:30,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730218932] [2019-11-20 03:56:30,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:56:30,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:30,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:56:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:56:30,142 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2019-11-20 03:56:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:30,289 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-11-20 03:56:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:56:30,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-20 03:56:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:30,291 INFO L225 Difference]: With dead ends: 116 [2019-11-20 03:56:30,291 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 03:56:30,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:56:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 03:56:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2019-11-20 03:56:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 03:56:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-11-20 03:56:30,303 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 17 [2019-11-20 03:56:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:30,303 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-11-20 03:56:30,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:56:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-11-20 03:56:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 03:56:30,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:30,305 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-20 03:56:30,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:30,509 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash -415013654, now seen corresponding path program 2 times [2019-11-20 03:56:30,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:30,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508669375] [2019-11-20 03:56:30,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:30,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508669375] [2019-11-20 03:56:30,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632008415] [2019-11-20 03:56:30,550 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:30,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 03:56:30,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:56:30,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:56:30,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 03:56:30,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:30,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-11-20 03:56:30,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669098022] [2019-11-20 03:56:30,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:56:30,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:30,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:56:30,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:56:30,617 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 7 states. [2019-11-20 03:56:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:30,719 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2019-11-20 03:56:30,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:56:30,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-20 03:56:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:30,721 INFO L225 Difference]: With dead ends: 139 [2019-11-20 03:56:30,721 INFO L226 Difference]: Without dead ends: 138 [2019-11-20 03:56:30,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:56:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-20 03:56:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 39. [2019-11-20 03:56:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 03:56:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-20 03:56:30,730 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2019-11-20 03:56:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:30,731 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-20 03:56:30,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:56:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-20 03:56:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:56:30,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:30,744 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:30,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:30,947 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2095953530, now seen corresponding path program 2 times [2019-11-20 03:56:30,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:30,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383502151] [2019-11-20 03:56:30,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:31,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383502151] [2019-11-20 03:56:31,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802635574] [2019-11-20 03:56:31,005 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:31,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:56:31,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:56:31,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:56:31,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:31,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:31,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-20 03:56:31,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377423112] [2019-11-20 03:56:31,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:56:31,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:56:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:56:31,051 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2019-11-20 03:56:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:31,240 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-11-20 03:56:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 03:56:31,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-20 03:56:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:31,243 INFO L225 Difference]: With dead ends: 92 [2019-11-20 03:56:31,243 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 03:56:31,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:56:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 03:56:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 44. [2019-11-20 03:56:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 03:56:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-20 03:56:31,261 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 22 [2019-11-20 03:56:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:31,262 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-20 03:56:31,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:56:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-11-20 03:56:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 03:56:31,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:31,269 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:31,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:31,473 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288067, now seen corresponding path program 3 times [2019-11-20 03:56:31,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:31,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236532533] [2019-11-20 03:56:31,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:31,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236532533] [2019-11-20 03:56:31,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387159763] [2019-11-20 03:56:31,534 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:31,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 03:56:31,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:56:31,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:56:31,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 03:56:31,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:31,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 11 [2019-11-20 03:56:31,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918678615] [2019-11-20 03:56:31,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:56:31,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:31,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:56:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:56:31,640 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-11-20 03:56:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:32,307 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-11-20 03:56:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 03:56:32,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-20 03:56:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:32,311 INFO L225 Difference]: With dead ends: 143 [2019-11-20 03:56:32,311 INFO L226 Difference]: Without dead ends: 142 [2019-11-20 03:56:32,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=698, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 03:56:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-20 03:56:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2019-11-20 03:56:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 03:56:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-20 03:56:32,321 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 27 [2019-11-20 03:56:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:32,324 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-20 03:56:32,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:56:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-20 03:56:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 03:56:32,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:32,327 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:32,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:32,530 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1685598945, now seen corresponding path program 1 times [2019-11-20 03:56:32,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:32,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897556793] [2019-11-20 03:56:32,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:56:32,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897556793] [2019-11-20 03:56:32,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788793032] [2019-11-20 03:56:32,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:32,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:56:32,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 03:56:32,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:56:32,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-11-20 03:56:32,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062288004] [2019-11-20 03:56:32,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:56:32,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:56:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:56:32,790 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2019-11-20 03:56:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:32,930 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2019-11-20 03:56:32,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:56:32,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-20 03:56:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:32,932 INFO L225 Difference]: With dead ends: 147 [2019-11-20 03:56:32,932 INFO L226 Difference]: Without dead ends: 102 [2019-11-20 03:56:32,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-20 03:56:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-20 03:56:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-11-20 03:56:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 03:56:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-11-20 03:56:32,945 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 39 [2019-11-20 03:56:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:32,945 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-11-20 03:56:32,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:56:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-11-20 03:56:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 03:56:32,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:32,948 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:33,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:33,151 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1243466243, now seen corresponding path program 2 times [2019-11-20 03:56:33,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:33,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352884383] [2019-11-20 03:56:33,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:56:33,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352884383] [2019-11-20 03:56:33,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155111393] [2019-11-20 03:56:33,262 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:33,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:56:33,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:56:33,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:56:33,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:56:33,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:33,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-20 03:56:33,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040599988] [2019-11-20 03:56:33,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:56:33,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:33,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:56:33,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:56:33,319 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 10 states. [2019-11-20 03:56:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:33,578 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2019-11-20 03:56:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:56:33,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-11-20 03:56:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:33,580 INFO L225 Difference]: With dead ends: 142 [2019-11-20 03:56:33,580 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 03:56:33,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-11-20 03:56:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 03:56:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2019-11-20 03:56:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 03:56:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-11-20 03:56:33,594 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 39 [2019-11-20 03:56:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:33,595 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-11-20 03:56:33,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:56:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-11-20 03:56:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:56:33,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:33,596 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 03:56:33,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:33,800 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:56:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1165798321, now seen corresponding path program 3 times [2019-11-20 03:56:33,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:56:33,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760407992] [2019-11-20 03:56:33,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:56:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:56:33,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760407992] [2019-11-20 03:56:33,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59514442] [2019-11-20 03:56:33,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:33,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 03:56:33,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:56:33,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:56:33,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 03:56:34,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:34,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 13 [2019-11-20 03:56:34,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587772342] [2019-11-20 03:56:34,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 03:56:34,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:56:34,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:56:34,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:56:34,042 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 14 states. [2019-11-20 03:56:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:34,762 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2019-11-20 03:56:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 03:56:34,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-11-20 03:56:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:34,763 INFO L225 Difference]: With dead ends: 198 [2019-11-20 03:56:34,763 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:56:34,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 03:56:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:56:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:56:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:56:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:56:34,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-20 03:56:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:34,767 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:56:34,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 03:56:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:56:34,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:56:34,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:56:34,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:56:35,206 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2019-11-20 03:56:35,481 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2019-11-20 03:56:35,788 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 140 [2019-11-20 03:56:36,366 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 30 [2019-11-20 03:56:37,371 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 138 DAG size of output: 38 [2019-11-20 03:56:38,050 WARN L191 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 30 [2019-11-20 03:56:38,052 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-20 03:56:38,052 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 0 ULTIMATE.start_main_~N~0)) (.cse2 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse3 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse0 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse4 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse5 (and .cse1 (<= 0 ULTIMATE.start_main_~j~0) .cse2 .cse3))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse2 .cse3) (and (and .cse0 (and .cse4 .cse5)) (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (and .cse4 .cse5 (<= ULTIMATE.start_main_~m~0 0) (<= ULTIMATE.start_main_~j~0 0))))) [2019-11-20 03:56:38,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-20 03:56:38,053 INFO L447 ceAbstractionStarter]: At program point L36(lines 13 37) the Hoare annotation is: true [2019-11-20 03:56:38,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-20 03:56:38,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:56:38,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-20 03:56:38,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:56:38,053 INFO L444 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L440 ceAbstractionStarter]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (and (and (and (<= ULTIMATE.start_main_~n~0 2147483647) (and (<= 0 ULTIMATE.start_main_~N~0) (<= 0 ULTIMATE.start_main_~j~0)) (<= 0 ULTIMATE.start_main_~k~0) (<= 0 ULTIMATE.start_main_~i~0)) (<= ULTIMATE.start_main_~m~0 2147483647)) (<= ULTIMATE.start_main_~k~0 2147483646) (<= ULTIMATE.start_main_~N~0 2147483647)))) (or (and (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse0) (and (<= ULTIMATE.start_main_~i~0 0) .cse0))) [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-11-20 03:56:38,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-20 03:56:38,055 INFO L440 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse8 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse3 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= 0 ULTIMATE.start_main_~j~0)) (.cse9 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse5 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse6 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse2 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse0 (and .cse8 .cse3 .cse4 .cse9 .cse5 .cse6)) (.cse1 (<= ULTIMATE.start_main_~j~0 0)) (.cse7 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)))) (or (and .cse0 (<= ULTIMATE.start_main_~m~0 0) .cse1) (and (<= ULTIMATE.start_main_~i~0 0) .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) .cse7 (and .cse8 (<= 0 ULTIMATE.start_main_~k~0) .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~k~0 2147483646) .cse9 .cse6)) (and (and .cse2 (and .cse0 .cse1)) (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse7)))) [2019-11-20 03:56:38,055 INFO L444 ceAbstractionStarter]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-11-20 03:56:38,055 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-11-20 03:56:38,055 INFO L444 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2019-11-20 03:56:38,055 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-20 03:56:38,055 INFO L444 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-20 03:56:38,055 INFO L444 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-20 03:56:38,055 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-20 03:56:38,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:56:38 BoogieIcfgContainer [2019-11-20 03:56:38,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:56:38,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:56:38,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:56:38,096 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:56:38,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:56:26" (3/4) ... [2019-11-20 03:56:38,100 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:56:38,112 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 03:56:38,113 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:56:38,163 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7f27cbe-5e84-4abe-a60d-c5a5c8550488/bin/uautomizer/witness.graphml [2019-11-20 03:56:38,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:56:38,165 INFO L168 Benchmark]: Toolchain (without parser) took 12598.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -353.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:56:38,166 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:56:38,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:56:38,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:56:38,167 INFO L168 Benchmark]: Boogie Preprocessor took 23.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:56:38,168 INFO L168 Benchmark]: RCFGBuilder took 301.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:56:38,168 INFO L168 Benchmark]: TraceAbstraction took 11837.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.4 MB). Peak memory consumption was 443.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:56:38,169 INFO L168 Benchmark]: Witness Printer took 68.30 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:56:38,171 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 301.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11837.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.4 MB). Peak memory consumption was 443.1 MB. Max. memory is 11.5 GB. * Witness Printer took 68.30 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: ((((((i <= 0 && m <= 2147483647) && 0 <= N) && n + i <= 2147483647) && N <= 2147483647) && 0 <= i) || (((m <= 2147483647 && n <= 2147483647 && ((0 <= N && 0 <= j) && N <= 2147483647) && 0 <= i) && N <= i) && N <= k + 1)) || (((n <= 2147483647 && ((0 <= N && 0 <= j) && N <= 2147483647) && 0 <= i) && m <= 0) && j <= 0) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((n <= 2147483647 && 0 <= N) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) && m <= 0) && j <= 0) || (((((((i <= 0 && m <= 2147483647) && 0 <= N) && j <= 0) && n + i <= 2147483647) && 0 <= j) && N <= 2147483647) && 0 <= i)) || ((N <= i + 1 && N <= k + 1) && ((((((n <= 2147483647 && 0 <= k) && m <= 2147483647) && 0 <= N) && 0 <= j) && k <= 2147483646) && i <= 2147483646) && 0 <= i)) || (((m <= 2147483647 && (((((n <= 2147483647 && 0 <= N) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) && j <= 0) && N <= i) && N <= k + 1) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((N <= i + 1 && N <= k + 1) && (((((n <= 2147483647 && 0 <= N && 0 <= j) && 0 <= k) && 0 <= i) && m <= 2147483647) && k <= 2147483646) && N <= 2147483647) || (i <= 0 && (((((n <= 2147483647 && 0 <= N && 0 <= j) && 0 <= k) && 0 <= i) && m <= 2147483647) && k <= 2147483646) && N <= 2147483647) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 8 error locations. Result: SAFE, OverallTime: 11.7s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 321 SDtfs, 1164 SDslu, 557 SDs, 0 SdLazy, 985 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 2.4s 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 524 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 68 NumberOfFragments, 274 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3603530 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1386655 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s 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...