./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:58:33,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:58:33,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:58:33,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:58:33,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:58:33,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:58:33,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:58:33,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:58:33,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:58:33,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:58:33,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:58:33,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:58:33,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:58:33,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:58:33,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:58:33,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:58:33,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:58:33,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:58:33,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:58:33,228 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:58:33,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:58:33,229 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:58:33,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:58:33,231 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:58:33,231 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:58:33,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:58:33,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:58:33,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:58:33,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:58:33,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:58:33,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:58:33,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:58:33,236 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:58:33,236 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:58:33,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:58:33,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:58:33,237 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 10:58:33,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:58:33,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:58:33,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:58:33,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:58:33,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:58:33,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:58:33,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:58:33,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:58:33,246 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:58:33,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:58:33,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:58:33,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 10:58:33,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:58:33,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 10:58:33,247 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 10:58:33,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:58:33,248 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:58:33,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 10:58:33,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:58:33,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:58:33,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:58:33,248 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:58:33,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:58:33,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:58:33,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:58:33,249 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 10:58:33,249 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:58:33,249 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:58:33,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 10:58:33,249 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2018-11-28 10:58:33,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:58:33,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:58:33,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:58:33,283 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:58:33,284 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:58:33,284 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 10:58:33,324 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/data/0f2ceae13/4390eb5a35284628a059a655eafb863d/FLAG053c85146 [2018-11-28 10:58:33,742 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:58:33,742 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 10:58:33,748 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/data/0f2ceae13/4390eb5a35284628a059a655eafb863d/FLAG053c85146 [2018-11-28 10:58:33,759 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/data/0f2ceae13/4390eb5a35284628a059a655eafb863d [2018-11-28 10:58:33,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:58:33,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:58:33,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:58:33,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:58:33,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:58:33,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4d235d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33, skipping insertion in model container [2018-11-28 10:58:33,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:58:33,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:58:33,891 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:58:33,893 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:58:33,902 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:58:33,911 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:58:33,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33 WrapperNode [2018-11-28 10:58:33,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:58:33,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:58:33,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:58:33,912 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:58:33,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:58:33,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:58:33,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:58:33,926 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:58:33,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... [2018-11-28 10:58:33,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:58:33,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:58:33,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:58:33,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:58:33,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/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 [2018-11-28 10:58:34,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:58:34,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:58:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-28 10:58:34,021 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-28 10:58:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-28 10:58:34,021 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-28 10:58:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:58:34,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:58:34,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:58:34,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:58:34,185 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:58:34,185 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 10:58:34,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:58:34 BoogieIcfgContainer [2018-11-28 10:58:34,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:58:34,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:58:34,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:58:34,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:58:34,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:58:33" (1/3) ... [2018-11-28 10:58:34,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5251bd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:58:34, skipping insertion in model container [2018-11-28 10:58:34,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:58:33" (2/3) ... [2018-11-28 10:58:34,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5251bd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:58:34, skipping insertion in model container [2018-11-28 10:58:34,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:58:34" (3/3) ... [2018-11-28 10:58:34,193 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 10:58:34,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:58:34,210 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-28 10:58:34,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-28 10:58:34,255 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:58:34,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:58:34,255 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 10:58:34,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:58:34,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:58:34,256 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:58:34,256 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:58:34,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:58:34,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:58:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-28 10:58:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 10:58:34,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:34,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:34,282 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:34,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -359085562, now seen corresponding path program 1 times [2018-11-28 10:58:34,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:34,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:58:34,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:34,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:58:34,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:58:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:58:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:58:34,493 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 7 states. [2018-11-28 10:58:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:34,672 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-11-28 10:58:34,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 10:58:34,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-28 10:58:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:34,681 INFO L225 Difference]: With dead ends: 91 [2018-11-28 10:58:34,681 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 10:58:34,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:58:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 10:58:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-11-28 10:58:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 10:58:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-28 10:58:34,723 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 12 [2018-11-28 10:58:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:34,723 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-28 10:58:34,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:58:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-28 10:58:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 10:58:34,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:34,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:34,725 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:34,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:34,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1753249505, now seen corresponding path program 1 times [2018-11-28 10:58:34,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:34,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:34,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:34,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:58:34,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:34,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:58:34,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:58:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:58:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:58:34,745 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-11-28 10:58:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:34,762 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-28 10:58:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:58:34,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 10:58:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:34,764 INFO L225 Difference]: With dead ends: 74 [2018-11-28 10:58:34,764 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 10:58:34,765 INFO L631 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 [2018-11-28 10:58:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 10:58:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-28 10:58:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 10:58:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2018-11-28 10:58:34,776 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 13 [2018-11-28 10:58:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:34,776 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2018-11-28 10:58:34,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:58:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2018-11-28 10:58:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 10:58:34,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:34,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:34,778 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:34,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1245225281, now seen corresponding path program 1 times [2018-11-28 10:58:34,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:34,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:34,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:34,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:58:34,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:34,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:58:34,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:58:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:58:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:58:34,812 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 3 states. [2018-11-28 10:58:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:34,827 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2018-11-28 10:58:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:58:34,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 10:58:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:34,828 INFO L225 Difference]: With dead ends: 69 [2018-11-28 10:58:34,829 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 10:58:34,829 INFO L631 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 [2018-11-28 10:58:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 10:58:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 10:58:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 10:58:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-28 10:58:34,835 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 15 [2018-11-28 10:58:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:34,835 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-28 10:58:34,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:58:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-28 10:58:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 10:58:34,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:34,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:34,836 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:34,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash -52721888, now seen corresponding path program 1 times [2018-11-28 10:58:34,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:34,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:34,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:34,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:58:34,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:34,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:58:34,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:58:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:58:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:34,859 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 4 states. [2018-11-28 10:58:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:34,890 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-28 10:58:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:58:34,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-28 10:58:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:34,892 INFO L225 Difference]: With dead ends: 89 [2018-11-28 10:58:34,892 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 10:58:34,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 10:58:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-11-28 10:58:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 10:58:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2018-11-28 10:58:34,901 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 16 [2018-11-28 10:58:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:34,902 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-11-28 10:58:34,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:58:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2018-11-28 10:58:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 10:58:34,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:34,903 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:34,903 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:34,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash -571942417, now seen corresponding path program 1 times [2018-11-28 10:58:34,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:34,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 10:58:34,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:34,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:58:34,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:58:34,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:58:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:58:34,923 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 3 states. [2018-11-28 10:58:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:34,932 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2018-11-28 10:58:34,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:58:34,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 10:58:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:34,933 INFO L225 Difference]: With dead ends: 78 [2018-11-28 10:58:34,933 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 10:58:34,934 INFO L631 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 [2018-11-28 10:58:34,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 10:58:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 10:58:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 10:58:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-28 10:58:34,941 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 20 [2018-11-28 10:58:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:34,941 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-28 10:58:34,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:58:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-28 10:58:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 10:58:34,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:34,942 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:34,942 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:34,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash -550345698, now seen corresponding path program 1 times [2018-11-28 10:58:34,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:34,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 10:58:34,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:34,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:58:34,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:58:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:58:34,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:34,985 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-11-28 10:58:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,005 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2018-11-28 10:58:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:58:35,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-28 10:58:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,008 INFO L225 Difference]: With dead ends: 98 [2018-11-28 10:58:35,008 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 10:58:35,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 10:58:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-11-28 10:58:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 10:58:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2018-11-28 10:58:35,017 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 21 [2018-11-28 10:58:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,017 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2018-11-28 10:58:35,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:58:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2018-11-28 10:58:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 10:58:35,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,018 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,019 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash 838473927, now seen corresponding path program 1 times [2018-11-28 10:58:35,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:58:35,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:58:35,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:58:35,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:58:35,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:58:35,051 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand 5 states. [2018-11-28 10:58:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,124 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2018-11-28 10:58:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:58:35,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 10:58:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,126 INFO L225 Difference]: With dead ends: 129 [2018-11-28 10:58:35,126 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 10:58:35,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:58:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 10:58:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-28 10:58:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 10:58:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-11-28 10:58:35,135 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 23 [2018-11-28 10:58:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,135 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2018-11-28 10:58:35,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:58:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-28 10:58:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 10:58:35,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,136 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,137 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2032985165, now seen corresponding path program 1 times [2018-11-28 10:58:35,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 10:58:35,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:58:35,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:58:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:58:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:58:35,177 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 5 states. [2018-11-28 10:58:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,246 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-28 10:58:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:58:35,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-28 10:58:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,247 INFO L225 Difference]: With dead ends: 102 [2018-11-28 10:58:35,248 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 10:58:35,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:58:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 10:58:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-28 10:58:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 10:58:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2018-11-28 10:58:35,258 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 25 [2018-11-28 10:58:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,259 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2018-11-28 10:58:35,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:58:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2018-11-28 10:58:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 10:58:35,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,260 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,260 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash 878188252, now seen corresponding path program 1 times [2018-11-28 10:58:35,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 10:58:35,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:58:35,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:58:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:58:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:58:35,317 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand 5 states. [2018-11-28 10:58:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,394 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2018-11-28 10:58:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:58:35,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-28 10:58:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,396 INFO L225 Difference]: With dead ends: 123 [2018-11-28 10:58:35,396 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 10:58:35,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:58:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 10:58:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-11-28 10:58:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-28 10:58:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2018-11-28 10:58:35,407 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 36 [2018-11-28 10:58:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,408 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2018-11-28 10:58:35,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:58:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-28 10:58:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 10:58:35,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,409 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,409 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1444432349, now seen corresponding path program 1 times [2018-11-28 10:58:35,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 10:58:35,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:58:35,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:58:35,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:58:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:35,438 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 4 states. [2018-11-28 10:58:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,464 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2018-11-28 10:58:35,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:58:35,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-28 10:58:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,467 INFO L225 Difference]: With dead ends: 132 [2018-11-28 10:58:35,468 INFO L226 Difference]: Without dead ends: 131 [2018-11-28 10:58:35,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-28 10:58:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-28 10:58:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 10:58:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-11-28 10:58:35,488 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 34 [2018-11-28 10:58:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,488 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-11-28 10:58:35,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:58:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-28 10:58:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 10:58:35,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,489 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,490 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1982111316, now seen corresponding path program 1 times [2018-11-28 10:58:35,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 10:58:35,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:58:35,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:58:35,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:58:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:58:35,545 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 3 states. [2018-11-28 10:58:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,567 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-28 10:58:35,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:58:35,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-28 10:58:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,570 INFO L225 Difference]: With dead ends: 127 [2018-11-28 10:58:35,570 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 10:58:35,571 INFO L631 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 [2018-11-28 10:58:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 10:58:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-28 10:58:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 10:58:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2018-11-28 10:58:35,579 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 40 [2018-11-28 10:58:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,580 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2018-11-28 10:58:35,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:58:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2018-11-28 10:58:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 10:58:35,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,582 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,582 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 324073318, now seen corresponding path program 1 times [2018-11-28 10:58:35,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 10:58:35,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:58:35,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:58:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:58:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:58:35,614 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand 5 states. [2018-11-28 10:58:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,645 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-11-28 10:58:35,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:58:35,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-28 10:58:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,647 INFO L225 Difference]: With dead ends: 126 [2018-11-28 10:58:35,647 INFO L226 Difference]: Without dead ends: 125 [2018-11-28 10:58:35,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:58:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-28 10:58:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-28 10:58:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-28 10:58:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2018-11-28 10:58:35,657 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 40 [2018-11-28 10:58:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,658 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2018-11-28 10:58:35,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:58:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2018-11-28 10:58:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 10:58:35,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,659 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,660 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash 364458084, now seen corresponding path program 1 times [2018-11-28 10:58:35,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 10:58:35,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:58:35,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:58:35,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:58:35,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:58:35,712 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand 5 states. [2018-11-28 10:58:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,743 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2018-11-28 10:58:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:58:35,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 10:58:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,746 INFO L225 Difference]: With dead ends: 125 [2018-11-28 10:58:35,746 INFO L226 Difference]: Without dead ends: 124 [2018-11-28 10:58:35,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:58:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-28 10:58:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2018-11-28 10:58:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 10:58:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-11-28 10:58:35,756 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 45 [2018-11-28 10:58:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,756 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-11-28 10:58:35,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:58:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-28 10:58:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 10:58:35,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,758 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,758 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash -921113151, now seen corresponding path program 1 times [2018-11-28 10:58:35,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 10:58:35,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:58:35,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:58:35,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:58:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 10:58:35,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:58:35,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 10:58:35,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 10:58:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:58:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:58:35,884 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 8 states. [2018-11-28 10:58:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:35,952 INFO L93 Difference]: Finished difference Result 223 states and 286 transitions. [2018-11-28 10:58:35,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 10:58:35,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-28 10:58:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:35,954 INFO L225 Difference]: With dead ends: 223 [2018-11-28 10:58:35,954 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 10:58:35,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:58:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 10:58:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2018-11-28 10:58:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-28 10:58:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-11-28 10:58:35,967 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 47 [2018-11-28 10:58:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:35,968 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-11-28 10:58:35,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 10:58:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-11-28 10:58:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 10:58:35,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:35,969 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:35,970 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:35,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash -922396984, now seen corresponding path program 1 times [2018-11-28 10:58:35,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:35,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 10:58:35,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:35,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:58:35,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:58:35,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:58:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:58:35,997 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 3 states. [2018-11-28 10:58:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:36,007 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2018-11-28 10:58:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:58:36,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 10:58:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:36,009 INFO L225 Difference]: With dead ends: 128 [2018-11-28 10:58:36,009 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 10:58:36,010 INFO L631 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 [2018-11-28 10:58:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 10:58:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-28 10:58:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 10:58:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-11-28 10:58:36,020 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 47 [2018-11-28 10:58:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:36,020 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-11-28 10:58:36,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:58:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-11-28 10:58:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 10:58:36,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:36,021 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:36,021 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:36,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1470464639, now seen corresponding path program 1 times [2018-11-28 10:58:36,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:36,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:36,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 10:58:36,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:58:36,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:58:36,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:58:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:58:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:36,054 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 4 states. [2018-11-28 10:58:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:36,073 INFO L93 Difference]: Finished difference Result 136 states and 163 transitions. [2018-11-28 10:58:36,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:58:36,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-28 10:58:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:36,075 INFO L225 Difference]: With dead ends: 136 [2018-11-28 10:58:36,075 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 10:58:36,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:58:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 10:58:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-28 10:58:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 10:58:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2018-11-28 10:58:36,083 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 48 [2018-11-28 10:58:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:36,084 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2018-11-28 10:58:36,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:58:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2018-11-28 10:58:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 10:58:36,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:36,085 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:36,085 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:36,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:36,085 INFO L82 PathProgramCache]: Analyzing trace with hash -524468521, now seen corresponding path program 1 times [2018-11-28 10:58:36,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:36,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-28 10:58:36,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:58:36,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:58:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:36,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:58:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-28 10:58:36,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:58:36,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 10:58:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:58:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:58:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:58:36,202 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 6 states. [2018-11-28 10:58:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:36,296 INFO L93 Difference]: Finished difference Result 262 states and 341 transitions. [2018-11-28 10:58:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:58:36,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-28 10:58:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:36,298 INFO L225 Difference]: With dead ends: 262 [2018-11-28 10:58:36,298 INFO L226 Difference]: Without dead ends: 150 [2018-11-28 10:58:36,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:58:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-28 10:58:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2018-11-28 10:58:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 10:58:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2018-11-28 10:58:36,312 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 58 [2018-11-28 10:58:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:36,312 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-28 10:58:36,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:58:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2018-11-28 10:58:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 10:58:36,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:36,314 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:36,316 INFO L423 AbstractCegarLoop]: === Iteration 18 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:36,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1040597731, now seen corresponding path program 2 times [2018-11-28 10:58:36,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:58:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 23 proven. 86 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-28 10:58:36,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:58:36,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:58:36,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:58:36,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:58:36,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:58:36,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:58:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 231 proven. 15 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-28 10:58:36,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:58:36,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 10:58:36,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:58:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:58:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:58:36,467 INFO L87 Difference]: Start difference. First operand 136 states and 168 transitions. Second operand 6 states. [2018-11-28 10:58:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:36,554 INFO L93 Difference]: Finished difference Result 296 states and 391 transitions. [2018-11-28 10:58:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:58:36,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-11-28 10:58:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:36,556 INFO L225 Difference]: With dead ends: 296 [2018-11-28 10:58:36,556 INFO L226 Difference]: Without dead ends: 174 [2018-11-28 10:58:36,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:58:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-28 10:58:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-11-28 10:58:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-28 10:58:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 190 transitions. [2018-11-28 10:58:36,566 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 190 transitions. Word has length 111 [2018-11-28 10:58:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:36,567 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 190 transitions. [2018-11-28 10:58:36,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:58:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 190 transitions. [2018-11-28 10:58:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-28 10:58:36,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:58:36,568 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:58:36,569 INFO L423 AbstractCegarLoop]: === Iteration 19 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 10:58:36,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:58:36,569 INFO L82 PathProgramCache]: Analyzing trace with hash -296486197, now seen corresponding path program 3 times [2018-11-28 10:58:36,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:58:36,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:58:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:58:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:58:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:58:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 49 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-28 10:58:36,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:58:36,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:58:36,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 10:58:36,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 10:58:36,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:58:36,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:58:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-11-28 10:58:36,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:58:36,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-11-28 10:58:36,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 10:58:36,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 10:58:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:58:36,710 INFO L87 Difference]: Start difference. First operand 154 states and 190 transitions. Second operand 9 states. [2018-11-28 10:58:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:58:36,810 INFO L93 Difference]: Finished difference Result 209 states and 263 transitions. [2018-11-28 10:58:36,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:58:36,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2018-11-28 10:58:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:58:36,811 INFO L225 Difference]: With dead ends: 209 [2018-11-28 10:58:36,811 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 10:58:36,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-28 10:58:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 10:58:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 10:58:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 10:58:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 10:58:36,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-11-28 10:58:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:58:36,813 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:58:36,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 10:58:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:58:36,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 10:58:36,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 10:58:36,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 10:58:36,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 10:58:36,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 10:58:36,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 10:58:37,110 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 10:58:37,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= rec1_~i |rec1_#in~i|) (< 2147483647 |rec1_#in~i|)) (or (<= 1 rec1_~i) (< 2147483646 |rec1_#in~i|))) [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,111 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= |rec1_#t~ret1| 0) (= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-28 10:58:37,112 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (< 0 |rec2_#in~j|) (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))) [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,113 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 0 (+ |rec2_#t~ret3| 2147483647)) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (< 0 |rec2_#in~j|)) [2018-11-28 10:58:37,113 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,114 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,114 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-28 10:58:37,114 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-28 10:58:37,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 10:58:37,114 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 10:58:37,114 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 10:58:37,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 10:58:37,114 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-28 10:58:37,114 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-28 10:58:37,114 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-28 10:58:37,114 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-28 10:58:37,114 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-28 10:58:37,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:58:37 BoogieIcfgContainer [2018-11-28 10:58:37,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:58:37,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:58:37,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:58:37,118 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:58:37,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:58:34" (3/4) ... [2018-11-28 10:58:37,121 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 10:58:37,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 10:58:37,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-28 10:58:37,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-28 10:58:37,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 10:58:37,133 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 10:58:37,133 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 10:58:37,134 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 10:58:37,170 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_178d2eef-dab6-41c2-b01d-bdccec3d0b57/bin-2019/uautomizer/witness.graphml [2018-11-28 10:58:37,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:58:37,171 INFO L168 Benchmark]: Toolchain (without parser) took 3409.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -66.5 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:58:37,173 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:58:37,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.98 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:58:37,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.79 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:58:37,174 INFO L168 Benchmark]: Boogie Preprocessor took 13.32 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:58:37,174 INFO L168 Benchmark]: RCFGBuilder took 247.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:58:37,174 INFO L168 Benchmark]: TraceAbstraction took 2930.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.5 MB). Peak memory consumption was 187.6 MB. Max. memory is 11.5 GB. [2018-11-28 10:58:37,175 INFO L168 Benchmark]: Witness Printer took 53.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-28 10:58:37,176 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.98 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.79 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.32 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 247.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2930.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.5 MB). Peak memory consumption was 187.6 MB. Max. memory is 11.5 GB. * Witness Printer took 53.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 2.8s OverallTime, 19 OverallIterations, 14 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 779 SDtfs, 293 SDslu, 1707 SDs, 0 SdLazy, 589 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 121 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 343 PreInvPairs, 383 NumberOfFragments, 111 HoareAnnotationTreeSize, 343 FomulaSimplifications, 1817 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 228 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1079 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1056 ConstructedInterpolants, 0 QuantifiedInterpolants, 99242 SizeOfPredicates, 5 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 1734/1946 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...