./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c27ad91a5bec233234e07a14bfd5505e082df4cd .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:22:33,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:22:33,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:22:33,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:22:33,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:22:33,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:22:33,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:22:33,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:22:33,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:22:33,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:22:33,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:22:33,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:22:33,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:22:33,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:22:33,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:22:33,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:22:33,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:22:33,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:22:33,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:22:33,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:22:33,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:22:33,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:22:33,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:22:33,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:22:33,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:22:33,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:22:33,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:22:33,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:22:33,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:22:33,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:22:33,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:22:33,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:22:33,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:22:33,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:22:33,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:22:33,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:22:33,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:22:33,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:22:33,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:22:33,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:22:33,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:22:33,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:22:33,891 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:22:33,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:22:33,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:22:33,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:22:33,894 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:22:33,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:22:33,894 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:22:33,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:22:33,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:22:33,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:22:33,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:22:33,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:22:33,897 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:22:33,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:22:33,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:22:33,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:22:33,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:22:33,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:22:33,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:22:33,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:22:33,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:33,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:22:33,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:22:33,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:22:33,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:22:33,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:22:33,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:22:33,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:22:33,902 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2019-11-28 20:22:34,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:22:34,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:22:34,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:22:34,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:22:34,255 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:22:34,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2019-11-28 20:22:34,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc428644/916aa0d19dcb41f1a13bcda70f231f3d/FLAG77fabf450 [2019-11-28 20:22:34,772 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:22:34,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2019-11-28 20:22:34,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc428644/916aa0d19dcb41f1a13bcda70f231f3d/FLAG77fabf450 [2019-11-28 20:22:35,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc428644/916aa0d19dcb41f1a13bcda70f231f3d [2019-11-28 20:22:35,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:22:35,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:22:35,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:35,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:22:35,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:22:35,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a273c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35, skipping insertion in model container [2019-11-28 20:22:35,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:22:35,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:22:35,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:35,382 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:22:35,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:35,409 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:22:35,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35 WrapperNode [2019-11-28 20:22:35,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:35,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:35,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:22:35,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:22:35,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:35,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:22:35,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:22:35,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:22:35,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:22:35,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:22:35,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:22:35,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:22:35,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 20:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 20:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 20:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 20:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:22:35,829 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:22:35,829 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 20:22:35,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:35 BoogieIcfgContainer [2019-11-28 20:22:35,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:22:35,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:22:35,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:22:35,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:22:35,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:35" (1/3) ... [2019-11-28 20:22:35,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5099fcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:35, skipping insertion in model container [2019-11-28 20:22:35,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (2/3) ... [2019-11-28 20:22:35,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5099fcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:35, skipping insertion in model container [2019-11-28 20:22:35,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:35" (3/3) ... [2019-11-28 20:22:35,860 INFO L109 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a.c [2019-11-28 20:22:35,881 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:22:35,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-28 20:22:35,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-28 20:22:35,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:22:35,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:22:35,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:22:35,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:22:35,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:22:35,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:22:35,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:22:35,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:22:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-28 20:22:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:22:36,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:22:36,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-11-28 20:22:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042086518] [2019-11-28 20:22:36,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042086518] [2019-11-28 20:22:36,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:36,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:36,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246817341] [2019-11-28 20:22:36,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:36,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:36,253 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-11-28 20:22:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,455 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-28 20:22:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:36,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-28 20:22:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,472 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:22:36,472 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:22:36,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:22:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-28 20:22:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:22:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-28 20:22:36,556 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-28 20:22:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,557 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-28 20:22:36,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-28 20:22:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:22:36,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:22:36,560 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-11-28 20:22:36,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654010730] [2019-11-28 20:22:36,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654010730] [2019-11-28 20:22:36,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:36,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:36,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510089378] [2019-11-28 20:22:36,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:36,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:36,608 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-28 20:22:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,635 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-28 20:22:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:36,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 20:22:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,637 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:22:36,637 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 20:22:36,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 20:22:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-28 20:22:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:22:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-11-28 20:22:36,650 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-11-28 20:22:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,651 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-11-28 20:22:36,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-11-28 20:22:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:22:36,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,652 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:36,653 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,653 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-11-28 20:22:36,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555221817] [2019-11-28 20:22:36,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555221817] [2019-11-28 20:22:36,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:36,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:22:36,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357048678] [2019-11-28 20:22:36,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:22:36,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:22:36,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:36,773 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2019-11-28 20:22:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,986 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-11-28 20:22:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:22:36,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-28 20:22:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,992 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:22:36,992 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 20:22:36,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 20:22:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-28 20:22:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 20:22:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-11-28 20:22:37,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 13 [2019-11-28 20:22:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,016 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-11-28 20:22:37,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:22:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-11-28 20:22:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:22:37,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,019 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,019 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-11-28 20:22:37,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931761808] [2019-11-28 20:22:37,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:22:37,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931761808] [2019-11-28 20:22:37,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:37,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387142414] [2019-11-28 20:22:37,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:37,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:37,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:37,104 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2019-11-28 20:22:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,122 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-11-28 20:22:37,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:37,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 20:22:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,130 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:22:37,131 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:22:37,132 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-11-28 20:22:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:22:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-28 20:22:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 20:22:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-28 20:22:37,155 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2019-11-28 20:22:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,156 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-28 20:22:37,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-28 20:22:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:22:37,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,158 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-11-28 20:22:37,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484476251] [2019-11-28 20:22:37,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484476251] [2019-11-28 20:22:37,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:22:37,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808200120] [2019-11-28 20:22:37,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:37,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:37,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:37,252 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-28 20:22:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,319 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-28 20:22:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:37,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 20:22:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,322 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:22:37,323 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 20:22:37,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 20:22:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2019-11-28 20:22:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:22:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-11-28 20:22:37,339 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2019-11-28 20:22:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,340 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-28 20:22:37,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-11-28 20:22:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:22:37,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,342 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,343 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,343 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-11-28 20:22:37,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012891340] [2019-11-28 20:22:37,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012891340] [2019-11-28 20:22:37,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:22:37,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648439198] [2019-11-28 20:22:37,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:37,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:37,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:37,406 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 5 states. [2019-11-28 20:22:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,488 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2019-11-28 20:22:37,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:37,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 20:22:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,492 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:22:37,493 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 20:22:37,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 20:22:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-11-28 20:22:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:22:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-11-28 20:22:37,523 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2019-11-28 20:22:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,526 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-11-28 20:22:37,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-11-28 20:22:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:22:37,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,530 INFO L410 BasicCegarLoop]: trace histogram [3, 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-11-28 20:22:37,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2082036524, now seen corresponding path program 1 times [2019-11-28 20:22:37,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993473959] [2019-11-28 20:22:37,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993473959] [2019-11-28 20:22:37,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491071201] [2019-11-28 20:22:37,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:37,846 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:37,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2019-11-28 20:22:37,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30102969] [2019-11-28 20:22:37,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:22:37,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:22:37,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:22:37,932 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 14 states. [2019-11-28 20:22:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,325 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-11-28 20:22:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:22:38,327 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-28 20:22:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,330 INFO L225 Difference]: With dead ends: 191 [2019-11-28 20:22:38,330 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 20:22:38,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:22:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 20:22:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2019-11-28 20:22:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:22:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-11-28 20:22:38,362 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 32 [2019-11-28 20:22:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,363 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-11-28 20:22:38,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:22:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-11-28 20:22:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:22:38,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,367 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:38,573 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1488102097, now seen corresponding path program 1 times [2019-11-28 20:22:38,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823406084] [2019-11-28 20:22:38,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:38,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823406084] [2019-11-28 20:22:38,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862419071] [2019-11-28 20:22:38,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:22:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:22:38,745 INFO L287 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:22:38,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:38,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-28 20:22:38,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145400127] [2019-11-28 20:22:38,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:38,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:38,797 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 5 states. [2019-11-28 20:22:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,876 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2019-11-28 20:22:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:22:38,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 20:22:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,878 INFO L225 Difference]: With dead ends: 153 [2019-11-28 20:22:38,878 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 20:22:38,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 20:22:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 20:22:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:22:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-11-28 20:22:38,904 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2019-11-28 20:22:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,905 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-11-28 20:22:38,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-11-28 20:22:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 20:22:38,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,915 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:39,126 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash 627143089, now seen corresponding path program 1 times [2019-11-28 20:22:39,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904165386] [2019-11-28 20:22:39,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 61 proven. 16 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-28 20:22:39,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904165386] [2019-11-28 20:22:39,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341106698] [2019-11-28 20:22:39,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:39,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-28 20:22:39,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:39,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-11-28 20:22:39,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51822533] [2019-11-28 20:22:39,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 20:22:39,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:22:39,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:22:39,656 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 19 states. [2019-11-28 20:22:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,962 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2019-11-28 20:22:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:22:39,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2019-11-28 20:22:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,964 INFO L225 Difference]: With dead ends: 119 [2019-11-28 20:22:39,964 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:22:39,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-11-28 20:22:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:22:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:22:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:22:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:22:39,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-11-28 20:22:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,967 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:22:39,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 20:22:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:22:39,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:22:40,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:40,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:22:40,440 INFO L246 CegarLoopResult]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:40,441 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (or (and (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483646))) [2019-11-28 20:22:40,441 INFO L246 CegarLoopResult]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-11-28 20:22:40,441 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,441 INFO L246 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,441 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,441 INFO L242 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (or (and (<= (+ |f_#t~ret0| 1) f_~x) (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483646))) [2019-11-28 20:22:40,441 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,441 INFO L246 CegarLoopResult]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,442 INFO L246 CegarLoopResult]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,442 INFO L246 CegarLoopResult]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,442 INFO L246 CegarLoopResult]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:40,442 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,442 INFO L249 CegarLoopResult]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-11-28 20:22:40,443 INFO L246 CegarLoopResult]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,443 INFO L246 CegarLoopResult]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:40,443 INFO L246 CegarLoopResult]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:40,443 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,443 INFO L246 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-11-28 20:22:40,443 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,444 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= |g_#in~x| g_~x) (not (<= |g_#in~x| 2147483647))) (or (<= 1 g_~x) (not (<= |g_#in~x| 2147483646)))) [2019-11-28 20:22:40,444 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,444 INFO L246 CegarLoopResult]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,444 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,444 INFO L242 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (and (or (<= |g_#in~x| 1) (not (<= |g_#in~x| 2147483647))) (or (and (<= 0 |g_#t~ret2|) (<= 1 g_~x) (<= |g_#t~ret2| 0) (= |g_#in~x| g_~x)) (not (<= |g_#in~x| 2147483646)))) [2019-11-28 20:22:40,444 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,444 INFO L246 CegarLoopResult]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,444 INFO L246 CegarLoopResult]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L249 CegarLoopResult]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:22:40,445 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:22:40,446 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:22:40,446 INFO L242 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 20:22:40,447 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-28 20:22:40,447 INFO L246 CegarLoopResult]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-11-28 20:22:40,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:40 BoogieIcfgContainer [2019-11-28 20:22:40,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:22:40,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:22:40,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:22:40,452 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:22:40,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:35" (3/4) ... [2019-11-28 20:22:40,456 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:22:40,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-28 20:22:40,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-28 20:22:40,466 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 20:22:40,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:22:40,517 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:22:40,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:22:40,520 INFO L168 Benchmark]: Toolchain (without parser) took 5358.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,521 INFO L168 Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:40,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.13 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,523 INFO L168 Benchmark]: Boogie Preprocessor took 16.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,523 INFO L168 Benchmark]: RCFGBuilder took 315.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,524 INFO L168 Benchmark]: TraceAbstraction took 4618.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,524 INFO L168 Benchmark]: Witness Printer took 65.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,529 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.65 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.13 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4618.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * Witness Printer took 65.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 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: 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 - 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, 42 locations, 10 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 9, TraceHistogramMax: 8, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 273 SDtfs, 294 SDslu, 819 SDs, 0 SdLazy, 770 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 81 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 109 PreInvPairs, 115 NumberOfFragments, 78 HoareAnnotationTreeSize, 109 FomulaSimplifications, 72 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 159 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 43667 SizeOfPredicates, 8 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 360/385 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...