./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/bitvector/byte_add_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 499e83f84eda8d3ed438ea1340f9ee54d9540a66 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 11:25:30,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 11:25:30,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 11:25:30,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 11:25:30,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 11:25:30,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 11:25:30,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 11:25:30,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 11:25:30,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 11:25:30,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 11:25:30,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 11:25:30,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 11:25:30,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 11:25:30,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 11:25:30,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 11:25:30,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 11:25:30,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 11:25:30,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 11:25:30,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 11:25:30,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 11:25:30,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 11:25:30,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 11:25:30,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 11:25:30,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 11:25:30,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 11:25:30,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 11:25:30,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 11:25:30,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 11:25:30,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 11:25:30,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 11:25:30,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 11:25:30,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 11:25:30,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 11:25:30,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 11:25:30,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 11:25:30,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 11:25:30,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 11:25:30,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 11:25:30,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 11:25:30,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 11:25:30,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 11:25:30,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-08-27 11:25:30,712 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 11:25:30,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 11:25:30,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 11:25:30,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 11:25:30,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 11:25:30,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 11:25:30,718 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 11:25:30,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 11:25:30,718 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 11:25:30,718 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 11:25:30,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 11:25:30,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 11:25:30,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 11:25:30,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 11:25:30,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 11:25:30,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 11:25:30,720 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 11:25:30,720 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 11:25:30,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 11:25:30,721 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 11:25:30,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 11:25:30,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 11:25:30,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 11:25:30,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 11:25:30,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:25:30,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 11:25:30,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 11:25:30,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 11:25:30,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 11:25:30,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 11:25:30,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 11:25:30,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 11:25:30,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 499e83f84eda8d3ed438ea1340f9ee54d9540a66 [2021-08-27 11:25:30,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 11:25:31,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 11:25:31,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 11:25:31,012 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 11:25:31,013 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 11:25:31,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-08-27 11:25:31,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cc29f7c/454421646b4b45b6b71417609963e3fe/FLAG384c2cf39 [2021-08-27 11:25:31,468 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 11:25:31,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-08-27 11:25:31,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cc29f7c/454421646b4b45b6b71417609963e3fe/FLAG384c2cf39 [2021-08-27 11:25:31,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cc29f7c/454421646b4b45b6b71417609963e3fe [2021-08-27 11:25:31,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 11:25:31,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 11:25:31,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 11:25:31,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 11:25:31,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 11:25:31,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71928dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31, skipping insertion in model container [2021-08-27 11:25:31,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 11:25:31,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 11:25:31,690 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i[863,876] [2021-08-27 11:25:31,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:25:31,751 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 11:25:31,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i[863,876] [2021-08-27 11:25:31,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:25:31,816 INFO L208 MainTranslator]: Completed translation [2021-08-27 11:25:31,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31 WrapperNode [2021-08-27 11:25:31,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 11:25:31,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 11:25:31,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 11:25:31,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 11:25:31,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 11:25:31,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 11:25:31,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 11:25:31,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 11:25:31,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 11:25:31,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 11:25:31,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 11:25:31,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 11:25:31,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (1/1) ... [2021-08-27 11:25:31,915 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:25:31,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:31,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 11:25:31,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 11:25:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 11:25:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 11:25:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 11:25:31,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 11:25:32,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 11:25:32,444 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-27 11:25:32,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:32 BoogieIcfgContainer [2021-08-27 11:25:32,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 11:25:32,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 11:25:32,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 11:25:32,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 11:25:32,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:25:31" (1/3) ... [2021-08-27 11:25:32,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f51d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:25:32, skipping insertion in model container [2021-08-27 11:25:32,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:31" (2/3) ... [2021-08-27 11:25:32,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f51d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:25:32, skipping insertion in model container [2021-08-27 11:25:32,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:32" (3/3) ... [2021-08-27 11:25:32,464 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2021-08-27 11:25:32,468 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 11:25:32,469 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-08-27 11:25:32,503 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 11:25:32,508 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 11:25:32,509 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-08-27 11:25:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-27 11:25:32,525 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:32,525 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-27 11:25:32,525 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:32,528 INFO L82 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-08-27 11:25:32,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:32,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237591912] [2021-08-27 11:25:32,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:32,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:32,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237591912] [2021-08-27 11:25:32,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237591912] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:32,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:32,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-27 11:25:32,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811853050] [2021-08-27 11:25:32,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 11:25:32,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:32,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 11:25:32,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:25:32,680 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:32,696 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-08-27 11:25:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 11:25:32,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-08-27 11:25:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:32,704 INFO L225 Difference]: With dead ends: 135 [2021-08-27 11:25:32,704 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 11:25:32,706 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:25:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 11:25:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 11:25:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-08-27 11:25:32,733 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-08-27 11:25:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:32,734 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-08-27 11:25:32,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-08-27 11:25:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 11:25:32,735 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:32,735 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:32,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 11:25:32,736 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-08-27 11:25:32,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:32,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092638709] [2021-08-27 11:25:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:32,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:32,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092638709] [2021-08-27 11:25:32,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092638709] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:32,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:32,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:25:32,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782648837] [2021-08-27 11:25:32,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:32,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:32,834 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,006 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-08-27 11:25:33,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:33,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-27 11:25:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,009 INFO L225 Difference]: With dead ends: 145 [2021-08-27 11:25:33,010 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 11:25:33,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 11:25:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-08-27 11:25:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-08-27 11:25:33,041 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-08-27 11:25:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,041 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-08-27 11:25:33,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-08-27 11:25:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 11:25:33,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:33,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 11:25:33,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,044 INFO L82 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-08-27 11:25:33,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178732768] [2021-08-27 11:25:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:33,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178732768] [2021-08-27 11:25:33,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178732768] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:33,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165617373] [2021-08-27 11:25:33,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:33,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:33,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:33,226 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,480 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-08-27 11:25:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:33,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-27 11:25:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,483 INFO L225 Difference]: With dead ends: 221 [2021-08-27 11:25:33,483 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 11:25:33,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 11:25:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-08-27 11:25:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-08-27 11:25:33,490 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-08-27 11:25:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,490 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-08-27 11:25:33,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-08-27 11:25:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:25:33,492 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,492 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:33,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 11:25:33,492 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:33,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-08-27 11:25:33,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091388166] [2021-08-27 11:25:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:33,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091388166] [2021-08-27 11:25:33,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091388166] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:25:33,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333973866] [2021-08-27 11:25:33,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:33,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:33,579 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,585 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2021-08-27 11:25:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:33,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 11:25:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,587 INFO L225 Difference]: With dead ends: 162 [2021-08-27 11:25:33,587 INFO L226 Difference]: Without dead ends: 81 [2021-08-27 11:25:33,589 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-27 11:25:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-08-27 11:25:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2021-08-27 11:25:33,602 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 23 [2021-08-27 11:25:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,603 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2021-08-27 11:25:33,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2021-08-27 11:25:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 11:25:33,608 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,608 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 11:25:33,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 11:25:33,609 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1486873965, now seen corresponding path program 1 times [2021-08-27 11:25:33,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924864919] [2021-08-27 11:25:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:33,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924864919] [2021-08-27 11:25:33,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924864919] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:25:33,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146028117] [2021-08-27 11:25:33,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:33,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:33,677 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,694 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2021-08-27 11:25:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:33,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-27 11:25:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,695 INFO L225 Difference]: With dead ends: 105 [2021-08-27 11:25:33,695 INFO L226 Difference]: Without dead ends: 92 [2021-08-27 11:25:33,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-27 11:25:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-08-27 11:25:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2021-08-27 11:25:33,700 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 29 [2021-08-27 11:25:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,700 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2021-08-27 11:25:33,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-08-27 11:25:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 11:25:33,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,702 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 11:25:33,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 11:25:33,702 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1796976081, now seen corresponding path program 1 times [2021-08-27 11:25:33,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099294893] [2021-08-27 11:25:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:33,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099294893] [2021-08-27 11:25:33,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099294893] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:33,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851941941] [2021-08-27 11:25:33,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:33,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:33,841 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:34,010 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2021-08-27 11:25:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:34,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-27 11:25:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:34,019 INFO L225 Difference]: With dead ends: 247 [2021-08-27 11:25:34,019 INFO L226 Difference]: Without dead ends: 177 [2021-08-27 11:25:34,020 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-27 11:25:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2021-08-27 11:25:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2021-08-27 11:25:34,033 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 29 [2021-08-27 11:25:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:34,033 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2021-08-27 11:25:34,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2021-08-27 11:25:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 11:25:34,034 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:34,034 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:34,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 11:25:34,034 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash 543877549, now seen corresponding path program 1 times [2021-08-27 11:25:34,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:34,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888253657] [2021-08-27 11:25:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:34,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:34,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:34,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888253657] [2021-08-27 11:25:34,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888253657] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:34,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657564032] [2021-08-27 11:25:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:34,113 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:34,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:34,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 11:25:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:34,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 11:25:34,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:34,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657564032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:34,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:34,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-08-27 11:25:34,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842911632] [2021-08-27 11:25:34,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:34,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:34,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:34,479 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:34,652 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2021-08-27 11:25:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:34,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-27 11:25:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:34,654 INFO L225 Difference]: With dead ends: 213 [2021-08-27 11:25:34,654 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 11:25:34,655 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 11:25:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2021-08-27 11:25:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 137 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2021-08-27 11:25:34,664 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 32 [2021-08-27 11:25:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:34,664 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2021-08-27 11:25:34,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2021-08-27 11:25:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 11:25:34,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:34,667 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:34,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:34,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:34,881 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash 372269661, now seen corresponding path program 1 times [2021-08-27 11:25:34,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:34,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300244247] [2021-08-27 11:25:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:34,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:35,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:35,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300244247] [2021-08-27 11:25:35,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300244247] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:35,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642160549] [2021-08-27 11:25:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:35,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:35,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:35,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:35,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 11:25:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:35,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 11:25:35,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:35,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642160549] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:35,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:35,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-08-27 11:25:35,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335900953] [2021-08-27 11:25:35,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:35,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:35,449 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:35,546 INFO L93 Difference]: Finished difference Result 255 states and 329 transitions. [2021-08-27 11:25:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:35,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-27 11:25:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:35,548 INFO L225 Difference]: With dead ends: 255 [2021-08-27 11:25:35,549 INFO L226 Difference]: Without dead ends: 139 [2021-08-27 11:25:35,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 64.2ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:25:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-27 11:25:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2021-08-27 11:25:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-08-27 11:25:35,554 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 39 [2021-08-27 11:25:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:35,554 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-08-27 11:25:35,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-08-27 11:25:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 11:25:35,559 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:35,559 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:35,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:35,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-08-27 11:25:35,774 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1054853098, now seen corresponding path program 1 times [2021-08-27 11:25:35,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:35,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657874139] [2021-08-27 11:25:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:35,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:25:35,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:35,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657874139] [2021-08-27 11:25:35,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657874139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:35,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:35,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:35,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289455872] [2021-08-27 11:25:35,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:35,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:35,842 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:35,994 INFO L93 Difference]: Finished difference Result 326 states and 434 transitions. [2021-08-27 11:25:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-27 11:25:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:35,996 INFO L225 Difference]: With dead ends: 326 [2021-08-27 11:25:35,996 INFO L226 Difference]: Without dead ends: 230 [2021-08-27 11:25:35,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-27 11:25:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2021-08-27 11:25:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 155 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2021-08-27 11:25:36,001 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 48 [2021-08-27 11:25:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:36,002 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2021-08-27 11:25:36,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2021-08-27 11:25:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 11:25:36,002 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:36,002 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:36,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 11:25:36,003 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:36,003 INFO L82 PathProgramCache]: Analyzing trace with hash -847771261, now seen corresponding path program 1 times [2021-08-27 11:25:36,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:36,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146484370] [2021-08-27 11:25:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:36,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 11:25:36,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:36,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146484370] [2021-08-27 11:25:36,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146484370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:36,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:36,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:36,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842526811] [2021-08-27 11:25:36,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:36,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:36,084 INFO L87 Difference]: Start difference. First operand 156 states and 206 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:36,238 INFO L93 Difference]: Finished difference Result 430 states and 586 transitions. [2021-08-27 11:25:36,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:36,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-08-27 11:25:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:36,241 INFO L225 Difference]: With dead ends: 430 [2021-08-27 11:25:36,241 INFO L226 Difference]: Without dead ends: 295 [2021-08-27 11:25:36,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-27 11:25:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2021-08-27 11:25:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 194 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2021-08-27 11:25:36,249 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 64 [2021-08-27 11:25:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:36,250 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2021-08-27 11:25:36,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2021-08-27 11:25:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 11:25:36,251 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:36,251 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:36,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 11:25:36,251 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash 220871532, now seen corresponding path program 1 times [2021-08-27 11:25:36,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:36,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611447441] [2021-08-27 11:25:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:36,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 11:25:36,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:36,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611447441] [2021-08-27 11:25:36,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611447441] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:36,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772450954] [2021-08-27 11:25:36,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:36,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:36,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:36,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:36,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 11:25:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:36,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 11:25:36,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-27 11:25:36,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772450954] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:36,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:36,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-08-27 11:25:36,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713920920] [2021-08-27 11:25:36,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:36,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:36,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:36,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:25:36,888 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:37,070 INFO L93 Difference]: Finished difference Result 861 states and 1221 transitions. [2021-08-27 11:25:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:25:37,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-27 11:25:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:37,074 INFO L225 Difference]: With dead ends: 861 [2021-08-27 11:25:37,074 INFO L226 Difference]: Without dead ends: 680 [2021-08-27 11:25:37,074 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 63.4ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:25:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-08-27 11:25:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 393. [2021-08-27 11:25:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.346938775510204) internal successors, (528), 392 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 528 transitions. [2021-08-27 11:25:37,087 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 528 transitions. Word has length 80 [2021-08-27 11:25:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:37,088 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 528 transitions. [2021-08-27 11:25:37,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 528 transitions. [2021-08-27 11:25:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:37,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:37,089 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:37,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:37,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:37,305 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2021-08-27 11:25:37,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:37,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946763616] [2021-08-27 11:25:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:37,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 11:25:37,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:37,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946763616] [2021-08-27 11:25:37,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946763616] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:37,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597910031] [2021-08-27 11:25:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:37,429 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:37,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:37,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:37,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 11:25:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:37,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 11:25:37,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-08-27 11:25:38,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597910031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:38,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:38,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-08-27 11:25:38,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387791802] [2021-08-27 11:25:38,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:38,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:38,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:25:38,097 INFO L87 Difference]: Start difference. First operand 393 states and 528 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:38,219 INFO L93 Difference]: Finished difference Result 1276 states and 1709 transitions. [2021-08-27 11:25:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-27 11:25:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:38,224 INFO L225 Difference]: With dead ends: 1276 [2021-08-27 11:25:38,224 INFO L226 Difference]: Without dead ends: 906 [2021-08-27 11:25:38,225 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:25:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-08-27 11:25:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 661. [2021-08-27 11:25:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.362121212121212) internal successors, (899), 660 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 899 transitions. [2021-08-27 11:25:38,243 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 899 transitions. Word has length 83 [2021-08-27 11:25:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:38,243 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 899 transitions. [2021-08-27 11:25:38,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 899 transitions. [2021-08-27 11:25:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:38,245 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:38,245 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:38,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:38,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:38,461 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash -45908259, now seen corresponding path program 1 times [2021-08-27 11:25:38,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:38,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286073324] [2021-08-27 11:25:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:38,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 11:25:38,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:38,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286073324] [2021-08-27 11:25:38,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286073324] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:38,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505360607] [2021-08-27 11:25:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:38,594 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:38,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:38,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:38,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 11:25:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:38,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 11:25:38,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 11:25:39,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505360607] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:39,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:39,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-08-27 11:25:39,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037947325] [2021-08-27 11:25:39,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 11:25:39,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:39,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 11:25:39,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:25:39,821 INFO L87 Difference]: Start difference. First operand 661 states and 899 transitions. Second operand has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:40,269 INFO L93 Difference]: Finished difference Result 2384 states and 3167 transitions. [2021-08-27 11:25:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 11:25:40,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-27 11:25:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:40,278 INFO L225 Difference]: With dead ends: 2384 [2021-08-27 11:25:40,278 INFO L226 Difference]: Without dead ends: 2347 [2021-08-27 11:25:40,279 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 250.3ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-08-27 11:25:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2021-08-27 11:25:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 851. [2021-08-27 11:25:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.383529411764706) internal successors, (1176), 850 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1176 transitions. [2021-08-27 11:25:40,320 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1176 transitions. Word has length 83 [2021-08-27 11:25:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:40,321 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1176 transitions. [2021-08-27 11:25:40,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1176 transitions. [2021-08-27 11:25:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 11:25:40,327 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:40,327 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:40,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:40,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-27 11:25:40,533 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1566001815, now seen corresponding path program 1 times [2021-08-27 11:25:40,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:40,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103747168] [2021-08-27 11:25:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:40,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 11:25:40,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:40,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103747168] [2021-08-27 11:25:40,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103747168] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:40,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737866423] [2021-08-27 11:25:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:40,589 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:40,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:40,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:40,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 11:25:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:40,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 11:25:40,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-27 11:25:41,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737866423] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:41,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:41,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-08-27 11:25:41,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822855208] [2021-08-27 11:25:41,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:41,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:41,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:41,206 INFO L87 Difference]: Start difference. First operand 851 states and 1176 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:41,288 INFO L93 Difference]: Finished difference Result 1835 states and 2507 transitions. [2021-08-27 11:25:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-27 11:25:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:41,293 INFO L225 Difference]: With dead ends: 1835 [2021-08-27 11:25:41,293 INFO L226 Difference]: Without dead ends: 1309 [2021-08-27 11:25:41,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-08-27 11:25:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1038. [2021-08-27 11:25:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.3751205400192863) internal successors, (1426), 1037 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1426 transitions. [2021-08-27 11:25:41,328 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1426 transitions. Word has length 89 [2021-08-27 11:25:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:41,328 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1426 transitions. [2021-08-27 11:25:41,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1426 transitions. [2021-08-27 11:25:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 11:25:41,330 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:41,330 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:41,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:41,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:41,549 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1246814763, now seen corresponding path program 1 times [2021-08-27 11:25:41,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:41,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461351871] [2021-08-27 11:25:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:41,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 11:25:41,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:41,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461351871] [2021-08-27 11:25:41,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461351871] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:41,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245105279] [2021-08-27 11:25:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:41,676 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:41,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:41,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:41,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 11:25:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:42,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 11:25:42,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-27 11:25:42,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245105279] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:42,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:42,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2021-08-27 11:25:42,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568825792] [2021-08-27 11:25:42,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 11:25:42,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:42,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 11:25:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-08-27 11:25:42,489 INFO L87 Difference]: Start difference. First operand 1038 states and 1426 transitions. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:46,271 INFO L93 Difference]: Finished difference Result 5812 states and 7733 transitions. [2021-08-27 11:25:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-08-27 11:25:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-27 11:25:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:46,285 INFO L225 Difference]: With dead ends: 5812 [2021-08-27 11:25:46,285 INFO L226 Difference]: Without dead ends: 4527 [2021-08-27 11:25:46,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 1058.2ms TimeCoverageRelationStatistics Valid=753, Invalid=5567, Unknown=0, NotChecked=0, Total=6320 [2021-08-27 11:25:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2021-08-27 11:25:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 1307. [2021-08-27 11:25:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 1.339969372128637) internal successors, (1750), 1306 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1750 transitions. [2021-08-27 11:25:46,355 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1750 transitions. Word has length 89 [2021-08-27 11:25:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:46,355 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 1750 transitions. [2021-08-27 11:25:46,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1750 transitions. [2021-08-27 11:25:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-27 11:25:46,358 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:46,358 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:46,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:46,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:46,586 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1646942485, now seen corresponding path program 1 times [2021-08-27 11:25:46,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:46,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924535035] [2021-08-27 11:25:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:46,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-27 11:25:46,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:46,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924535035] [2021-08-27 11:25:46,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924535035] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:46,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41318763] [2021-08-27 11:25:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:46,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:46,678 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:46,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 11:25:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:46,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 11:25:46,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-27 11:25:47,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41318763] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:47,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:47,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2021-08-27 11:25:47,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556286931] [2021-08-27 11:25:47,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:25:47,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:25:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:47,312 INFO L87 Difference]: Start difference. First operand 1307 states and 1750 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:47,511 INFO L93 Difference]: Finished difference Result 2149 states and 2832 transitions. [2021-08-27 11:25:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:25:47,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-27 11:25:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:47,515 INFO L225 Difference]: With dead ends: 2149 [2021-08-27 11:25:47,516 INFO L226 Difference]: Without dead ends: 1509 [2021-08-27 11:25:47,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.6ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:25:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2021-08-27 11:25:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 851. [2021-08-27 11:25:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.336470588235294) internal successors, (1136), 850 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1136 transitions. [2021-08-27 11:25:47,540 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1136 transitions. Word has length 97 [2021-08-27 11:25:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:47,540 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1136 transitions. [2021-08-27 11:25:47,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1136 transitions. [2021-08-27 11:25:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 11:25:47,542 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:47,542 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:47,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:47,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-27 11:25:47,757 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1786362551, now seen corresponding path program 1 times [2021-08-27 11:25:47,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:47,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267355113] [2021-08-27 11:25:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:47,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-27 11:25:47,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:47,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267355113] [2021-08-27 11:25:47,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267355113] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:47,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:47,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:25:47,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865721844] [2021-08-27 11:25:47,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:47,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:47,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:47,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:47,850 INFO L87 Difference]: Start difference. First operand 851 states and 1136 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:48,082 INFO L93 Difference]: Finished difference Result 2004 states and 2642 transitions. [2021-08-27 11:25:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 11:25:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-27 11:25:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:48,085 INFO L225 Difference]: With dead ends: 2004 [2021-08-27 11:25:48,085 INFO L226 Difference]: Without dead ends: 986 [2021-08-27 11:25:48,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 41.5ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:25:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-08-27 11:25:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 408. [2021-08-27 11:25:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.3316953316953317) internal successors, (542), 407 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 542 transitions. [2021-08-27 11:25:48,098 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 542 transitions. Word has length 101 [2021-08-27 11:25:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:48,098 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 542 transitions. [2021-08-27 11:25:48,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 542 transitions. [2021-08-27 11:25:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 11:25:48,100 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:48,100 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:48,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 11:25:48,100 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-08-27 11:25:48,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:48,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940890424] [2021-08-27 11:25:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:48,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:25:48,141 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 11:25:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:25:48,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 11:25:48,200 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 11:25:48,201 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:48,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 11:25:48,214 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 11:25:48,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 11:25:48 BoogieIcfgContainer [2021-08-27 11:25:48,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 11:25:48,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 11:25:48,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 11:25:48,262 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 11:25:48,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:32" (3/4) ... [2021-08-27 11:25:48,265 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 11:25:48,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 11:25:48,266 INFO L168 Benchmark]: Toolchain (without parser) took 16770.28 ms. Allocated memory was 50.3 MB in the beginning and 249.6 MB in the end (delta: 199.2 MB). Free memory was 27.6 MB in the beginning and 110.3 MB in the end (delta: -82.6 MB). Peak memory consumption was 116.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:48,267 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 31.9 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:48,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.08 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 27.5 MB in the beginning and 47.4 MB in the end (delta: -19.9 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:48,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.43 ms. Allocated memory is still 65.0 MB. Free memory was 47.4 MB in the beginning and 45.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:48,267 INFO L168 Benchmark]: Boogie Preprocessor took 30.29 ms. Allocated memory is still 65.0 MB. Free memory was 45.3 MB in the beginning and 44.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:48,268 INFO L168 Benchmark]: RCFGBuilder took 545.03 ms. Allocated memory is still 65.0 MB. Free memory was 44.0 MB in the beginning and 32.3 MB in the end (delta: 11.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:48,268 INFO L168 Benchmark]: TraceAbstraction took 15814.27 ms. Allocated memory was 65.0 MB in the beginning and 249.6 MB in the end (delta: 184.5 MB). Free memory was 31.6 MB in the beginning and 110.3 MB in the end (delta: -78.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:48,268 INFO L168 Benchmark]: Witness Printer took 3.41 ms. Allocated memory is still 249.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:48,269 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 31.9 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 320.08 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 27.5 MB in the beginning and 47.4 MB in the end (delta: -19.9 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.43 ms. Allocated memory is still 65.0 MB. Free memory was 47.4 MB in the beginning and 45.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.29 ms. Allocated memory is still 65.0 MB. Free memory was 45.3 MB in the beginning and 44.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 545.03 ms. Allocated memory is still 65.0 MB. Free memory was 44.0 MB in the beginning and 32.3 MB in the end (delta: 11.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15814.27 ms. Allocated memory was 65.0 MB in the beginning and 249.6 MB in the end (delta: 184.5 MB). Free memory was 31.6 MB in the beginning and 110.3 MB in the end (delta: -78.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 16.1 GB. * Witness Printer took 3.41 ms. Allocated memory is still 249.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 88. Possible FailurePath: [L116] unsigned int a, b, r; [L117] a = __VERIFIER_nondet_uint() [L119] b = 234770789 [L34] unsigned char a0, a1, a2, a3; [L35] unsigned char b0, b1, b2, b3; [L36] unsigned char r0, r1, r2, r3; [L37] unsigned short carry; [L38] unsigned short partial_sum; [L39] unsigned int r; [L40] unsigned char i; [L41] unsigned char na, nb; [L42] a0 = a [L43] a1 = a >> 8 [L44] a2 = a >> 16U [L45] a3 = a >> 24U [L46] b0 = b [L47] b1 = b >> 8U [L48] b2 = b >> 16U [L49] b3 = b >> 24U [L50] na = (unsigned char)4 [L51] COND FALSE !(a3 == (unsigned char)0) [L60] nb = (unsigned char)4 [L61] COND FALSE !(b3 == (unsigned char)0) [L70] carry = (unsigned short)0 [L71] i = (unsigned char)0 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND TRUE i == (unsigned char)0 [L76] EXPR partial_sum + a0 [L76] partial_sum = partial_sum + a0 [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND TRUE i == (unsigned char)0 [L82] EXPR partial_sum + b0 [L82] partial_sum = partial_sum + b0 [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)255) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND TRUE i == (unsigned char)0 [L91] r0 = (unsigned char)partial_sum [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND FALSE !(i == (unsigned char)0) [L77] COND TRUE i == (unsigned char)1 [L77] EXPR partial_sum + a1 [L77] partial_sum = partial_sum + a1 [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND TRUE i == (unsigned char)1 [L83] EXPR partial_sum + b1 [L83] partial_sum = partial_sum + b1 [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)255) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND FALSE !(i == (unsigned char)0) [L92] COND TRUE i == (unsigned char)1 [L92] r1 = (unsigned char)partial_sum [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND FALSE !(i == (unsigned char)0) [L77] COND FALSE !(i == (unsigned char)1) [L78] COND TRUE i == (unsigned char)2 [L78] EXPR partial_sum + a2 [L78] partial_sum = partial_sum + a2 [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND TRUE i == (unsigned char)2 [L84] EXPR partial_sum + b2 [L84] partial_sum = partial_sum + b2 [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)255) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND TRUE i == (unsigned char)2 [L93] r2 = (unsigned char)partial_sum [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND FALSE !(i == (unsigned char)0) [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND TRUE i == (unsigned char)3 [L79] EXPR partial_sum + a3 [L79] partial_sum = partial_sum + a3 [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND TRUE i == (unsigned char)3 [L85] EXPR partial_sum + b3 [L85] partial_sum = partial_sum + b3 [L87] COND FALSE !(partial_sum > ((unsigned char)255)) [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND TRUE i == (unsigned char)3 [L94] r3 = (unsigned char)partial_sum [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L99] COND FALSE !(i < (unsigned char)4) [L108] r1 << 8U [L108] r2 << 16U [L108] r3 << 24U - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 105]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 105]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 15711.0ms, OverallIterations: 18, TraceHistogramMax: 4, EmptinessCheckTime: 34.5ms, AutomataDifference: 6386.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1830 SDtfs, 2769 SDslu, 4730 SDs, 0 SdLazy, 5909 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3598.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 610 SyntacticMatches, 13 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 1748.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1307occurred in iteration=15, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 311.2ms AutomataMinimizationTime, 17 MinimizatonAttempts, 7116 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 100.7ms SsaConstructionTime, 1146.7ms SatisfiabilityAnalysisTime, 4436.4ms InterpolantComputationTime, 1616 NumberOfCodeBlocks, 1616 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1490 ConstructedInterpolants, 0 QuantifiedInterpolants, 7152 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1396 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 1080/1235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 11:25:48,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...