./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/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 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:17:38,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:17:38,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:17:38,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:17:38,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:17:38,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:17:38,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:17:38,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:17:38,136 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:17:38,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:17:38,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:17:38,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:17:38,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:17:38,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:17:38,140 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:17:38,141 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:17:38,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:17:38,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:17:38,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:17:38,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:17:38,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:17:38,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:17:38,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:17:38,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:17:38,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:17:38,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:17:38,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:17:38,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:17:38,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:17:38,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:17:38,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:17:38,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:17:38,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:17:38,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:17:38,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:17:38,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:17:38,158 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-18 10:17:38,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:17:38,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:17:38,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:17:38,170 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 10:17:38,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:17:38,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:17:38,171 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:17:38,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:17:38,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:17:38,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:17:38,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:17:38,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:17:38,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:17:38,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:17:38,172 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 10:17:38,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:17:38,173 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:17:38,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:17:38,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:17:38,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:17:38,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:17:38,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:17:38,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:17:38,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:17:38,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:17:38,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:17:38,174 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:17:38,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:17:38,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:17:38,175 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_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/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 -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2018-11-18 10:17:38,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:17:38,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:17:38,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:17:38,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:17:38,211 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:17:38,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 10:17:38,248 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/data/02b8509c7/08b3d351c11349e595b13e9ed546c965/FLAGd49b5be62 [2018-11-18 10:17:38,648 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:17:38,649 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 10:17:38,653 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/data/02b8509c7/08b3d351c11349e595b13e9ed546c965/FLAGd49b5be62 [2018-11-18 10:17:38,663 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/data/02b8509c7/08b3d351c11349e595b13e9ed546c965 [2018-11-18 10:17:38,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:17:38,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 10:17:38,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:17:38,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:17:38,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:17:38,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be87cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38, skipping insertion in model container [2018-11-18 10:17:38,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:17:38,688 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:17:38,793 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:17:38,796 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:17:38,805 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:17:38,814 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:17:38,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38 WrapperNode [2018-11-18 10:17:38,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:17:38,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:17:38,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:17:38,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:17:38,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... [2018-11-18 10:17:38,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:17:38,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:17:38,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:17:38,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:17:38,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/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-18 10:17:38,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:17:38,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:17:38,917 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-18 10:17:38,917 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-18 10:17:38,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:17:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 10:17:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-18 10:17:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-18 10:17:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:17:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:17:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:17:39,085 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:17:39,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:39 BoogieIcfgContainer [2018-11-18 10:17:39,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:17:39,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:17:39,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:17:39,090 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:17:39,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:17:38" (1/3) ... [2018-11-18 10:17:39,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278163c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:17:39, skipping insertion in model container [2018-11-18 10:17:39,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:38" (2/3) ... [2018-11-18 10:17:39,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278163c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:17:39, skipping insertion in model container [2018-11-18 10:17:39,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:39" (3/3) ... [2018-11-18 10:17:39,094 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 10:17:39,104 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:17:39,111 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-18 10:17:39,126 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-18 10:17:39,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:17:39,154 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:17:39,154 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:17:39,155 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:17:39,155 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:17:39,155 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:17:39,155 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:17:39,155 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:17:39,155 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:17:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-18 10:17:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 10:17:39,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,180 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:17:39,182 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-18 10:17:39,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,329 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-18 10:17:39,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:39,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:17:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:39,349 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-18 10:17:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,403 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-18 10:17:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:17:39,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-18 10:17:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,410 INFO L225 Difference]: With dead ends: 49 [2018-11-18 10:17:39,411 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 10:17:39,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-18 10:17:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 10:17:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 10:17:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 10:17:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 10:17:39,442 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2018-11-18 10:17:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,443 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 10:17:39,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:17:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 10:17:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 10:17:39,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:17:39,444 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-18 10:17:39,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,460 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-18 10:17:39,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:17:39,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:17:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:17:39,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:17:39,462 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-11-18 10:17:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,491 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-18 10:17:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:17:39,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 10:17:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,493 INFO L225 Difference]: With dead ends: 45 [2018-11-18 10:17:39,494 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 10:17:39,495 INFO L604 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-18 10:17:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 10:17:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-18 10:17:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 10:17:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-18 10:17:39,502 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-11-18 10:17:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,502 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-18 10:17:39,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:17:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-18 10:17:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:17:39,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,503 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:17:39,504 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1097781535, now seen corresponding path program 1 times [2018-11-18 10:17:39,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,556 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-18 10:17:39,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:39,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:17:39,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:39,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:39,558 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-18 10:17:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,664 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-18 10:17:39,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:17:39,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 10:17:39,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,665 INFO L225 Difference]: With dead ends: 66 [2018-11-18 10:17:39,665 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 10:17:39,666 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-18 10:17:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 10:17:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-18 10:17:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 10:17:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-18 10:17:39,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 20 [2018-11-18 10:17:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,673 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-18 10:17:39,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:17:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-18 10:17:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:17:39,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,674 INFO L375 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-18 10:17:39,675 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,675 INFO L82 PathProgramCache]: Analyzing trace with hash -328510744, now seen corresponding path program 1 times [2018-11-18 10:17:39,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,700 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-18 10:17:39,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:17:39,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:17:39,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:17:39,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:17:39,701 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 3 states. [2018-11-18 10:17:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,710 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-18 10:17:39,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:17:39,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 10:17:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,712 INFO L225 Difference]: With dead ends: 62 [2018-11-18 10:17:39,712 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 10:17:39,713 INFO L604 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-18 10:17:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 10:17:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-18 10:17:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 10:17:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-18 10:17:39,721 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 21 [2018-11-18 10:17:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,722 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-18 10:17:39,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:17:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-18 10:17:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:17:39,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,723 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:17:39,723 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2128388042, now seen corresponding path program 1 times [2018-11-18 10:17:39,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,750 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-18 10:17:39,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:17:39,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:17:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:17:39,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:17:39,751 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-11-18 10:17:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,760 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-18 10:17:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:17:39,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:17:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,761 INFO L225 Difference]: With dead ends: 57 [2018-11-18 10:17:39,761 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 10:17:39,761 INFO L604 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-18 10:17:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 10:17:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-18 10:17:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 10:17:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-18 10:17:39,766 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 23 [2018-11-18 10:17:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,766 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-18 10:17:39,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:17:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-18 10:17:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:17:39,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,767 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:17:39,767 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,768 INFO L82 PathProgramCache]: Analyzing trace with hash 178548671, now seen corresponding path program 1 times [2018-11-18 10:17:39,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 10:17:39,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:17:39,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:17:39,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:17:39,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:17:39,814 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-11-18 10:17:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,828 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-18 10:17:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:17:39,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 10:17:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,829 INFO L225 Difference]: With dead ends: 64 [2018-11-18 10:17:39,829 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 10:17:39,830 INFO L604 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-18 10:17:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 10:17:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-18 10:17:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 10:17:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-11-18 10:17:39,836 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2018-11-18 10:17:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,837 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-11-18 10:17:39,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:17:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2018-11-18 10:17:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:17:39,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,839 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 10:17:39,839 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1484175368, now seen corresponding path program 1 times [2018-11-18 10:17:39,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:17:39,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:17:39,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:17:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:17:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:17:39,855 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 3 states. [2018-11-18 10:17:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,863 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-18 10:17:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:17:39,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:17:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,864 INFO L225 Difference]: With dead ends: 61 [2018-11-18 10:17:39,865 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 10:17:39,865 INFO L604 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-18 10:17:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 10:17:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-18 10:17:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 10:17:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-18 10:17:39,870 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2018-11-18 10:17:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,870 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-18 10:17:39,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:17:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-18 10:17:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:17:39,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,871 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 10:17:39,871 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1235203803, now seen corresponding path program 1 times [2018-11-18 10:17:39,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:17:39,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:17:39,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:17:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:17:39,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:17:39,896 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-11-18 10:17:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:39,912 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-18 10:17:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:17:39,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 10:17:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:39,913 INFO L225 Difference]: With dead ends: 83 [2018-11-18 10:17:39,913 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 10:17:39,913 INFO L604 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-18 10:17:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 10:17:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-11-18 10:17:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 10:17:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-18 10:17:39,920 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 29 [2018-11-18 10:17:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:39,920 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-18 10:17:39,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:17:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-18 10:17:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 10:17:39,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:39,921 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:17:39,921 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:39,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1924993580, now seen corresponding path program 1 times [2018-11-18 10:17:39,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:39,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:39,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:39,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:17:39,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:39,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:39,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:17:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:39,968 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 5 states. [2018-11-18 10:17:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:40,058 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-18 10:17:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:17:40,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-18 10:17:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:40,060 INFO L225 Difference]: With dead ends: 93 [2018-11-18 10:17:40,060 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 10:17:40,060 INFO L604 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-18 10:17:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 10:17:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-18 10:17:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 10:17:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-11-18 10:17:40,071 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 33 [2018-11-18 10:17:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:40,071 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-11-18 10:17:40,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:17:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-11-18 10:17:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:17:40,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:40,072 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 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, 1, 1, 1, 1, 1] [2018-11-18 10:17:40,073 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:40,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:40,073 INFO L82 PathProgramCache]: Analyzing trace with hash 604021493, now seen corresponding path program 1 times [2018-11-18 10:17:40,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:40,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:17:40,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:40,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:40,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:17:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:40,110 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 5 states. [2018-11-18 10:17:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:40,179 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-11-18 10:17:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:17:40,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 10:17:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:40,180 INFO L225 Difference]: With dead ends: 92 [2018-11-18 10:17:40,180 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 10:17:40,181 INFO L604 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-18 10:17:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 10:17:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-11-18 10:17:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 10:17:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-11-18 10:17:40,191 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 44 [2018-11-18 10:17:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:40,193 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-11-18 10:17:40,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:17:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-18 10:17:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 10:17:40,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:40,195 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-11-18 10:17:40,195 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:40,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:40,196 INFO L82 PathProgramCache]: Analyzing trace with hash -495515594, now seen corresponding path program 1 times [2018-11-18 10:17:40,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:40,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 10:17:40,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:40,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:17:40,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:17:40,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:17:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:17:40,227 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-11-18 10:17:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:40,255 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2018-11-18 10:17:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:17:40,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-18 10:17:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:40,258 INFO L225 Difference]: With dead ends: 98 [2018-11-18 10:17:40,259 INFO L226 Difference]: Without dead ends: 97 [2018-11-18 10:17:40,259 INFO L604 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-18 10:17:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-18 10:17:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-18 10:17:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 10:17:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2018-11-18 10:17:40,275 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 42 [2018-11-18 10:17:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:40,275 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2018-11-18 10:17:40,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:17:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-11-18 10:17:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 10:17:40,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:40,276 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 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-18 10:17:40,277 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:40,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash 465451333, now seen corresponding path program 1 times [2018-11-18 10:17:40,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:40,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 10:17:40,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:40,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:17:40,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:17:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:17:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:17:40,307 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand 3 states. [2018-11-18 10:17:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:40,315 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-18 10:17:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:17:40,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 10:17:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:40,317 INFO L225 Difference]: With dead ends: 94 [2018-11-18 10:17:40,317 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 10:17:40,317 INFO L604 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-18 10:17:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 10:17:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-18 10:17:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 10:17:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-11-18 10:17:40,328 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 48 [2018-11-18 10:17:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:40,329 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-11-18 10:17:40,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:17:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2018-11-18 10:17:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:17:40,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:40,330 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-18 10:17:40,331 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:40,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1633453199, now seen corresponding path program 1 times [2018-11-18 10:17:40,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:40,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 10:17:40,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:40,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:40,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:17:40,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:40,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:40,372 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 5 states. [2018-11-18 10:17:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:40,415 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-11-18 10:17:40,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:17:40,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-18 10:17:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:40,416 INFO L225 Difference]: With dead ends: 93 [2018-11-18 10:17:40,416 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 10:17:40,417 INFO L604 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-18 10:17:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 10:17:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2018-11-18 10:17:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 10:17:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2018-11-18 10:17:40,424 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 58 [2018-11-18 10:17:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:40,424 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2018-11-18 10:17:40,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:17:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2018-11-18 10:17:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 10:17:40,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:40,425 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:17:40,426 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:40,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:40,426 INFO L82 PathProgramCache]: Analyzing trace with hash -887062779, now seen corresponding path program 1 times [2018-11-18 10:17:40,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:40,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:40,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 10:17:40,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:40,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:40,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:17:40,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:40,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:40,463 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 5 states. [2018-11-18 10:17:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:40,519 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-11-18 10:17:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:17:40,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 10:17:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:40,521 INFO L225 Difference]: With dead ends: 81 [2018-11-18 10:17:40,522 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 10:17:40,522 INFO L604 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-18 10:17:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 10:17:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-11-18 10:17:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 10:17:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-18 10:17:40,528 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 53 [2018-11-18 10:17:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:40,529 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-18 10:17:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:17:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-11-18 10:17:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 10:17:40,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:40,530 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-11-18 10:17:40,530 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:40,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 375918826, now seen corresponding path program 1 times [2018-11-18 10:17:40,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:40,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 10:17:40,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:17:40,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/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-18 10:17:40,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-18 10:17:40,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:17:40,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-18 10:17:40,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:17:40,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:17:40,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:17:40,685 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 6 states. [2018-11-18 10:17:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:40,724 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2018-11-18 10:17:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:17:40,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-18 10:17:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:40,727 INFO L225 Difference]: With dead ends: 154 [2018-11-18 10:17:40,727 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 10:17:40,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:17:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 10:17:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-11-18 10:17:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 10:17:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-11-18 10:17:40,736 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 71 [2018-11-18 10:17:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:40,737 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-11-18 10:17:40,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:17:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-18 10:17:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 10:17:40,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:17:40,739 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-18 10:17:40,740 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 10:17:40,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:40,740 INFO L82 PathProgramCache]: Analyzing trace with hash -530823221, now seen corresponding path program 1 times [2018-11-18 10:17:40,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:40,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-18 10:17:40,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:17:40,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/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-18 10:17:40,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:40,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 10:17:40,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:17:40,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2018-11-18 10:17:40,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:17:40,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:17:40,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:17:40,954 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 11 states. [2018-11-18 10:17:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:41,052 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-11-18 10:17:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:17:41,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2018-11-18 10:17:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:17:41,053 INFO L225 Difference]: With dead ends: 97 [2018-11-18 10:17:41,053 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:17:41,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:17:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:17:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:17:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:17:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:17:41,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-11-18 10:17:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:17:41,055 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:17:41,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:17:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:17:41,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:17:41,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:17:41,161 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,162 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-18 10:17:41,163 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-18 10:17:41,164 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,164 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,164 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-18 10:17:41,164 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-11-18 10:17:41,164 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,164 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (<= |rec2_#t~ret3| 0)) (< 2147483647 |rec2_#in~j|)) [2018-11-18 10:17:41,164 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,164 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,164 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,165 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,165 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,165 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-18 10:17:41,165 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,165 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 10:17:41,165 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:17:41,165 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 10:17:41,165 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:17:41,165 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:17:41,166 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-18 10:17:41,166 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-18 10:17:41,166 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-18 10:17:41,166 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-18 10:17:41,166 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-18 10:17:41,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:17:41 BoogieIcfgContainer [2018-11-18 10:17:41,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:17:41,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:17:41,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:17:41,169 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:17:41,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:39" (3/4) ... [2018-11-18 10:17:41,172 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:17:41,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:17:41,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-18 10:17:41,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-18 10:17:41,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:17:41,181 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 10:17:41,181 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 10:17:41,181 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 10:17:41,222 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_77e75a3a-bca1-4c4b-87a2-b0f5d2b1b71a/bin-2019/uautomizer/witness.graphml [2018-11-18 10:17:41,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:17:41,223 INFO L168 Benchmark]: Toolchain (without parser) took 2557.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 961.8 MB in the beginning and 803.8 MB in the end (delta: 158.0 MB). Peak memory consumption was 292.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:17:41,224 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:17:41,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.89 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:17:41,225 INFO L168 Benchmark]: Boogie Preprocessor took 17.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 945.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:17:41,225 INFO L168 Benchmark]: RCFGBuilder took 253.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:17:41,225 INFO L168 Benchmark]: TraceAbstraction took 2082.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 806.9 MB in the end (delta: 301.1 MB). Peak memory consumption was 301.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:17:41,225 INFO L168 Benchmark]: Witness Printer took 53.32 ms. Allocated memory is still 1.2 GB. Free memory was 806.9 MB in the beginning and 803.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:17:41,227 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.89 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 945.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 253.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2082.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 806.9 MB in the end (delta: 301.1 MB). Peak memory consumption was 301.1 MB. Max. memory is 11.5 GB. * Witness Printer took 53.32 ms. Allocated memory is still 1.2 GB. Free memory was 806.9 MB in the beginning and 803.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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.0s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 663 SDtfs, 198 SDslu, 1356 SDs, 0 SdLazy, 362 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, 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, 16 MinimizatonAttempts, 61 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 99 PreInvPairs, 103 NumberOfFragments, 48 HoareAnnotationTreeSize, 99 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 773 NumberOfCodeBlocks, 773 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 755 ConstructedInterpolants, 0 QuantifiedInterpolants, 56471 SizeOfPredicates, 3 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 674/723 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...