./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:18:31,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:18:31,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:18:31,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:18:31,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:18:31,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:18:31,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:18:31,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:18:31,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:18:31,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:18:31,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:18:31,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:18:31,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:18:31,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:18:31,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:18:31,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:18:31,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:18:31,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:18:31,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:18:31,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:18:31,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:18:31,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:18:31,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:18:31,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:18:31,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:18:31,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:18:31,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:18:31,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:18:31,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:18:31,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:18:31,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:18:31,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:18:31,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:18:31,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:18:31,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:18:31,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:18:31,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:18:31,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:18:31,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:18:31,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:18:31,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:18:31,858 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-12-07 14:18:31,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:18:31,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:18:31,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:18:31,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:18:31,868 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:18:31,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:18:31,869 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:18:31,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:18:31,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:18:31,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:18:31,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:18:31,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:18:31,870 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 14:18:31,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:18:31,870 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:18:31,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:18:31,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:18:31,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:18:31,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:18:31,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:18:31,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:18:31,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:18:31,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:18:31,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:18:31,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:18:31,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:18:31,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:18:31,872 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:18:31,872 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-12-07 14:18:31,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:18:31,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:18:31,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:18:31,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:18:31,983 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:18:31,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-12-07 14:18:32,020 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/data/aaeb25364/cc2713446b4a439a906f56d6abd43d20/FLAG1bdd1211f [2019-12-07 14:18:32,350 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:18:32,351 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-12-07 14:18:32,355 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/data/aaeb25364/cc2713446b4a439a906f56d6abd43d20/FLAG1bdd1211f [2019-12-07 14:18:32,363 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/data/aaeb25364/cc2713446b4a439a906f56d6abd43d20 [2019-12-07 14:18:32,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:18:32,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:18:32,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:18:32,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:18:32,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:18:32,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb40537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32, skipping insertion in model container [2019-12-07 14:18:32,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:18:32,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:18:32,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:18:32,495 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:18:32,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:18:32,555 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:18:32,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32 WrapperNode [2019-12-07 14:18:32,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:18:32,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:18:32,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:18:32,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:18:32,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:18:32,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:18:32,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:18:32,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:18:32,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... [2019-12-07 14:18:32,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:18:32,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:18:32,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:18:32,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:18:32,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:18:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-12-07 14:18:32,631 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-12-07 14:18:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-12-07 14:18:32,631 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-12-07 14:18:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:18:32,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:18:32,750 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:18:32,750 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 14:18:32,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:18:32 BoogieIcfgContainer [2019-12-07 14:18:32,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:18:32,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:18:32,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:18:32,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:18:32,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:18:32" (1/3) ... [2019-12-07 14:18:32,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fb0cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:18:32, skipping insertion in model container [2019-12-07 14:18:32,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:32" (2/3) ... [2019-12-07 14:18:32,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fb0cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:18:32, skipping insertion in model container [2019-12-07 14:18:32,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:18:32" (3/3) ... [2019-12-07 14:18:32,756 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-12-07 14:18:32,763 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:18:32,767 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 14:18:32,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 14:18:32,789 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:18:32,789 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:18:32,789 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:18:32,789 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:18:32,789 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:18:32,790 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:18:32,790 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:18:32,790 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:18:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-07 14:18:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:18:32,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:32,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:32,807 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:32,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-12-07 14:18:32,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:32,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421270721] [2019-12-07 14:18:32,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:32,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421270721] [2019-12-07 14:18:32,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:32,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:18:32,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695492563] [2019-12-07 14:18:32,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:18:32,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:18:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:18:32,951 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-12-07 14:18:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,082 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-12-07 14:18:33,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:18:33,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-12-07 14:18:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,091 INFO L225 Difference]: With dead ends: 86 [2019-12-07 14:18:33,091 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 14:18:33,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:18:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 14:18:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-12-07 14:18:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 14:18:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-12-07 14:18:33,129 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-12-07 14:18:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,129 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-12-07 14:18:33,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:18:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-12-07 14:18:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:18:33,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-12-07 14:18:33,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839821102] [2019-12-07 14:18:33,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:33,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839821102] [2019-12-07 14:18:33,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:18:33,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114372558] [2019-12-07 14:18:33,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:33,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,148 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-12-07 14:18:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,159 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-12-07 14:18:33,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:33,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:18:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,160 INFO L225 Difference]: With dead ends: 70 [2019-12-07 14:18:33,161 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 14:18:33,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 14:18:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-12-07 14:18:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 14:18:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-12-07 14:18:33,171 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-12-07 14:18:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,172 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-12-07 14:18:33,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-12-07 14:18:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:18:33,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,172 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-12-07 14:18:33,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685352954] [2019-12-07 14:18:33,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:33,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685352954] [2019-12-07 14:18:33,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:18:33,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279832531] [2019-12-07 14:18:33,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:33,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,190 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-12-07 14:18:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,199 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-12-07 14:18:33,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:33,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 14:18:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,200 INFO L225 Difference]: With dead ends: 65 [2019-12-07 14:18:33,200 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:18:33,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:18:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 14:18:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:18:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-12-07 14:18:33,208 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-12-07 14:18:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,208 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-12-07 14:18:33,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-12-07 14:18:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:18:33,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,209 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-12-07 14:18:33,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735963722] [2019-12-07 14:18:33,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:33,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735963722] [2019-12-07 14:18:33,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:18:33,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173595511] [2019-12-07 14:18:33,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:33,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:33,233 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-12-07 14:18:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,250 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-12-07 14:18:33,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:33,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 14:18:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,252 INFO L225 Difference]: With dead ends: 85 [2019-12-07 14:18:33,252 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 14:18:33,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 14:18:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-12-07 14:18:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 14:18:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-12-07 14:18:33,265 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-12-07 14:18:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,266 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-12-07 14:18:33,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-12-07 14:18:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:18:33,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,267 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,267 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-12-07 14:18:33,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822044718] [2019-12-07 14:18:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:18:33,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822044718] [2019-12-07 14:18:33,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:18:33,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022513099] [2019-12-07 14:18:33,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:33,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,286 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-12-07 14:18:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,294 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-12-07 14:18:33,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:33,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:18:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,295 INFO L225 Difference]: With dead ends: 74 [2019-12-07 14:18:33,295 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 14:18:33,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 14:18:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-12-07 14:18:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 14:18:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-12-07 14:18:33,303 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-12-07 14:18:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,303 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-12-07 14:18:33,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-12-07 14:18:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:18:33,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,304 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,304 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-12-07 14:18:33,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925334982] [2019-12-07 14:18:33,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:18:33,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925334982] [2019-12-07 14:18:33,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:18:33,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090986316] [2019-12-07 14:18:33,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:33,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:33,328 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-12-07 14:18:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,344 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-12-07 14:18:33,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:33,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 14:18:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,346 INFO L225 Difference]: With dead ends: 94 [2019-12-07 14:18:33,346 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 14:18:33,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 14:18:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-12-07 14:18:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 14:18:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-12-07 14:18:33,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-12-07 14:18:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,355 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-12-07 14:18:33,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-12-07 14:18:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:18:33,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,355 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,356 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-12-07 14:18:33,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61064579] [2019-12-07 14:18:33,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:33,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61064579] [2019-12-07 14:18:33,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120117331] [2019-12-07 14:18:33,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:18:33,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:33,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:18:33,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-12-07 14:18:33,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726752330] [2019-12-07 14:18:33,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:18:33,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:18:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:18:33,472 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-12-07 14:18:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,511 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-12-07 14:18:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:18:33,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 14:18:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,512 INFO L225 Difference]: With dead ends: 125 [2019-12-07 14:18:33,512 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 14:18:33,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:18:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 14:18:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-12-07 14:18:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 14:18:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-12-07 14:18:33,521 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-12-07 14:18:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,521 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-12-07 14:18:33,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:18:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-12-07 14:18:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:18:33,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,522 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:33,723 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-12-07 14:18:33,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141082850] [2019-12-07 14:18:33,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:18:33,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141082850] [2019-12-07 14:18:33,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:18:33,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177342882] [2019-12-07 14:18:33,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:18:33,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:18:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:33,761 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-12-07 14:18:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,806 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-12-07 14:18:33,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:18:33,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 14:18:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,808 INFO L225 Difference]: With dead ends: 149 [2019-12-07 14:18:33,808 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 14:18:33,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:18:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 14:18:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-12-07 14:18:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 14:18:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-12-07 14:18:33,817 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-12-07 14:18:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,818 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-12-07 14:18:33,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:18:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-12-07 14:18:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:18:33,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,819 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2019-12-07 14:18:33,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007142713] [2019-12-07 14:18:33,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 14:18:33,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007142713] [2019-12-07 14:18:33,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:18:33,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112324195] [2019-12-07 14:18:33,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:18:33,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:18:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:33,850 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-12-07 14:18:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,889 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-12-07 14:18:33,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:18:33,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 14:18:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,890 INFO L225 Difference]: With dead ends: 158 [2019-12-07 14:18:33,890 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 14:18:33,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:18:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 14:18:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-12-07 14:18:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 14:18:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-12-07 14:18:33,900 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-12-07 14:18:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,901 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-12-07 14:18:33,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:18:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-12-07 14:18:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:18:33,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,902 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2019-12-07 14:18:33,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340893215] [2019-12-07 14:18:33,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 14:18:33,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340893215] [2019-12-07 14:18:33,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:18:33,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242269622] [2019-12-07 14:18:33,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:33,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:33,933 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-12-07 14:18:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,947 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-12-07 14:18:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:33,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 14:18:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,949 INFO L225 Difference]: With dead ends: 94 [2019-12-07 14:18:33,949 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 14:18:33,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 14:18:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-12-07 14:18:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 14:18:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-12-07 14:18:33,956 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2019-12-07 14:18:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:33,956 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-12-07 14:18:33,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-12-07 14:18:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 14:18:33,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:33,958 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:33,958 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:33,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:33,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2019-12-07 14:18:33,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:33,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565229766] [2019-12-07 14:18:33,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 14:18:33,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565229766] [2019-12-07 14:18:33,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:33,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:18:33,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434279153] [2019-12-07 14:18:33,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:33,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:33,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,983 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-12-07 14:18:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:33,991 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-12-07 14:18:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:33,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 14:18:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:33,993 INFO L225 Difference]: With dead ends: 91 [2019-12-07 14:18:33,993 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 14:18:33,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 14:18:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 14:18:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 14:18:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-12-07 14:18:34,000 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2019-12-07 14:18:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:34,001 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-12-07 14:18:34,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-12-07 14:18:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 14:18:34,002 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:34,002 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:34,002 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:34,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-12-07 14:18:34,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:34,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229464429] [2019-12-07 14:18:34,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 14:18:34,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229464429] [2019-12-07 14:18:34,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:34,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:18:34,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157716199] [2019-12-07 14:18:34,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:18:34,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:18:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:34,053 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-12-07 14:18:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:34,075 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-12-07 14:18:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:18:34,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-07 14:18:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:34,077 INFO L225 Difference]: With dead ends: 90 [2019-12-07 14:18:34,077 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 14:18:34,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 14:18:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 14:18:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 14:18:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-12-07 14:18:34,085 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2019-12-07 14:18:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:34,086 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-12-07 14:18:34,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:18:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-12-07 14:18:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:18:34,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:34,087 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:34,088 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2019-12-07 14:18:34,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:34,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751533236] [2019-12-07 14:18:34,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 14:18:34,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751533236] [2019-12-07 14:18:34,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:34,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:18:34,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108474941] [2019-12-07 14:18:34,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:18:34,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:18:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:34,143 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-12-07 14:18:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:34,179 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-12-07 14:18:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:18:34,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 14:18:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:34,181 INFO L225 Difference]: With dead ends: 99 [2019-12-07 14:18:34,181 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 14:18:34,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:18:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 14:18:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-12-07 14:18:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 14:18:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-12-07 14:18:34,186 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 46 [2019-12-07 14:18:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:34,187 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-12-07 14:18:34,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:18:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-12-07 14:18:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:18:34,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:34,188 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:34,188 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash 138300185, now seen corresponding path program 1 times [2019-12-07 14:18:34,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:34,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535674010] [2019-12-07 14:18:34,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 14:18:34,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535674010] [2019-12-07 14:18:34,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813537181] [2019-12-07 14:18:34,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:18:34,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 14:18:34,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:18:34,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-12-07 14:18:34,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649471415] [2019-12-07 14:18:34,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:18:34,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:34,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:18:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:18:34,316 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 7 states. [2019-12-07 14:18:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:34,419 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-12-07 14:18:34,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:18:34,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 14:18:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:34,421 INFO L225 Difference]: With dead ends: 116 [2019-12-07 14:18:34,421 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 14:18:34,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:18:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 14:18:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-12-07 14:18:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 14:18:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-12-07 14:18:34,430 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 45 [2019-12-07 14:18:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:34,430 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-12-07 14:18:34,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:18:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-12-07 14:18:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:18:34,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:34,432 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:34,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:34,632 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:34,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-12-07 14:18:34,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:34,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668988676] [2019-12-07 14:18:34,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 14:18:34,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668988676] [2019-12-07 14:18:34,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074699275] [2019-12-07 14:18:34,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:34,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:18:34,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 14:18:34,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:18:34,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-12-07 14:18:34,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082907487] [2019-12-07 14:18:34,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:18:34,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:18:34,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:18:34,728 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 10 states. [2019-12-07 14:18:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:34,792 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2019-12-07 14:18:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:18:34,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-12-07 14:18:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:34,793 INFO L225 Difference]: With dead ends: 224 [2019-12-07 14:18:34,793 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 14:18:34,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:18:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 14:18:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-12-07 14:18:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 14:18:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-12-07 14:18:34,800 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2019-12-07 14:18:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:34,801 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-12-07 14:18:34,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:18:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-12-07 14:18:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:18:34,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:34,801 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:35,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:35,002 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-12-07 14:18:35,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:35,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639708019] [2019-12-07 14:18:35,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 14:18:35,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639708019] [2019-12-07 14:18:35,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:35,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:18:35,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033705395] [2019-12-07 14:18:35,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:35,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:35,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:35,020 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 3 states. [2019-12-07 14:18:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:35,026 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2019-12-07 14:18:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:35,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 14:18:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:35,027 INFO L225 Difference]: With dead ends: 132 [2019-12-07 14:18:35,027 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 14:18:35,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 14:18:35,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-12-07 14:18:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 14:18:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-12-07 14:18:35,033 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2019-12-07 14:18:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:35,033 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-12-07 14:18:35,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-12-07 14:18:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 14:18:35,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:35,034 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:35,034 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-12-07 14:18:35,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:35,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387914213] [2019-12-07 14:18:35,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 14:18:35,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387914213] [2019-12-07 14:18:35,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:35,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:18:35,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839654668] [2019-12-07 14:18:35,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:35,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:35,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:35,056 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 4 states. [2019-12-07 14:18:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:35,066 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-12-07 14:18:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:35,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 14:18:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:35,067 INFO L225 Difference]: With dead ends: 140 [2019-12-07 14:18:35,067 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 14:18:35,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 14:18:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-12-07 14:18:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 14:18:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-12-07 14:18:35,074 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2019-12-07 14:18:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:35,075 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-12-07 14:18:35,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-12-07 14:18:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:18:35,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:35,075 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:35,076 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:18:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1995865818, now seen corresponding path program 2 times [2019-12-07 14:18:35,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:35,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794199673] [2019-12-07 14:18:35,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 14:18:35,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794199673] [2019-12-07 14:18:35,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720809852] [2019-12-07 14:18:35,178 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:35,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:18:35,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:18:35,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:18:35,212 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 14:18:35,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:18:35,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-12-07 14:18:35,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426093347] [2019-12-07 14:18:35,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:18:35,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:35,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:18:35,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:18:35,235 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2019-12-07 14:18:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:35,364 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-12-07 14:18:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:18:35,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-12-07 14:18:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:35,364 INFO L225 Difference]: With dead ends: 155 [2019-12-07 14:18:35,364 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:18:35,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:18:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:18:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:18:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:18:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:18:35,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-12-07 14:18:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:35,366 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:18:35,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:18:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:18:35,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:18:35,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:35,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,836 INFO L249 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-12-07 14:18:35,836 INFO L242 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2019-12-07 14:18:35,836 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L242 CegarLoopResult]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (= |rec1_#in~i| rec1_~i)) (or .cse0 (and (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))))) [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L242 CegarLoopResult]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or (and (<= |rec1_#t~ret1| 0) (<= 1 rec1_~i)) .cse0) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) .cse0))) [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-12-07 14:18:35,837 INFO L246 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L242 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j) (<= 1 |rec2_#t~ret3|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L249 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:18:35,838 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 14:18:35,839 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-12-07 14:18:35,839 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-12-07 14:18:35,839 INFO L246 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-12-07 14:18:35,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:18:35 BoogieIcfgContainer [2019-12-07 14:18:35,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:18:35,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:18:35,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:18:35,843 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:18:35,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:18:32" (3/4) ... [2019-12-07 14:18:35,845 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:18:35,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-12-07 14:18:35,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-12-07 14:18:35,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 14:18:35,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:18:35,883 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_db5484ec-4595-4a33-9dc7-c9800daa91d7/bin/uautomizer/witness.graphml [2019-12-07 14:18:35,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:18:35,885 INFO L168 Benchmark]: Toolchain (without parser) took 3518.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 943.5 MB in the beginning and 838.4 MB in the end (delta: 105.2 MB). Peak memory consumption was 203.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:35,885 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:35,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:35,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:35,886 INFO L168 Benchmark]: Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:35,886 INFO L168 Benchmark]: RCFGBuilder took 161.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:35,886 INFO L168 Benchmark]: TraceAbstraction took 3090.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 845.2 MB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:35,887 INFO L168 Benchmark]: Witness Printer took 40.81 ms. Allocated memory is still 1.1 GB. Free memory was 845.2 MB in the beginning and 838.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:35,888 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 161.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3090.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 845.2 MB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. * Witness Printer took 40.81 ms. Allocated memory is still 1.1 GB. Free memory was 845.2 MB in the beginning and 838.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 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 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 2.7s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 687 SDtfs, 232 SDslu, 1730 SDs, 0 SdLazy, 623 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 225 PreInvPairs, 234 NumberOfFragments, 103 HoareAnnotationTreeSize, 225 FomulaSimplifications, 618 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 49059 SizeOfPredicates, 6 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 688/756 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...