./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --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/soft_float_4-2a.c.cil.c -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 9c532f6b804ad7a925ea1538a844c05d7db150e0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:27:21,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 11:27:21,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 11:27:21,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 11:27:21,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 11:27:21,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 11:27:21,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 11:27:21,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 11:27:21,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 11:27:21,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 11:27:21,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 11:27:21,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 11:27:21,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 11:27:21,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 11:27:21,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 11:27:21,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 11:27:21,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 11:27:21,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 11:27:21,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 11:27:21,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 11:27:21,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 11:27:21,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 11:27:21,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 11:27:21,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 11:27:21,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 11:27:21,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 11:27:21,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 11:27:21,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 11:27:21,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 11:27:21,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 11:27:21,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 11:27:21,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 11:27:21,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 11:27:21,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 11:27:21,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 11:27:21,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 11:27:21,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 11:27:21,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 11:27:21,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 11:27:21,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 11:27:21,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 11:27:21,756 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:27:21,792 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 11:27:21,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 11:27:21,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 11:27:21,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 11:27:21,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 11:27:21,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 11:27:21,799 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 11:27:21,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 11:27:21,800 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 11:27:21,800 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 11:27:21,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 11:27:21,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 11:27:21,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 11:27:21,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 11:27:21,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 11:27:21,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 11:27:21,802 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 11:27:21,802 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 11:27:21,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 11:27:21,802 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 11:27:21,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 11:27:21,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 11:27:21,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 11:27:21,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 11:27:21,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:27:21,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 11:27:21,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 11:27:21,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 11:27:21,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 11:27:21,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 11:27:21,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 11:27:21,810 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 11:27:21,811 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 -> 9c532f6b804ad7a925ea1538a844c05d7db150e0 [2021-08-27 11:27:22,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 11:27:22,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 11:27:22,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 11:27:22,147 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 11:27:22,148 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 11:27:22,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2021-08-27 11:27:22,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2672c3c3/24b222670dc14cc1af3f37c2d7363b4c/FLAG265f724d3 [2021-08-27 11:27:22,706 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 11:27:22,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2021-08-27 11:27:22,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2672c3c3/24b222670dc14cc1af3f37c2d7363b4c/FLAG265f724d3 [2021-08-27 11:27:23,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2672c3c3/24b222670dc14cc1af3f37c2d7363b4c [2021-08-27 11:27:23,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 11:27:23,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 11:27:23,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 11:27:23,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 11:27:23,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 11:27:23,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49723c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23, skipping insertion in model container [2021-08-27 11:27:23,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 11:27:23,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 11:27:23,327 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/soft_float_4-2a.c.cil.c[450,463] [2021-08-27 11:27:23,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:27:23,403 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 11:27:23,425 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/soft_float_4-2a.c.cil.c[450,463] [2021-08-27 11:27:23,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:27:23,480 INFO L208 MainTranslator]: Completed translation [2021-08-27 11:27:23,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23 WrapperNode [2021-08-27 11:27:23,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 11:27:23,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 11:27:23,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 11:27:23,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 11:27:23,488 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:27:23" (1/1) ... [2021-08-27 11:27:23,495 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:27:23" (1/1) ... [2021-08-27 11:27:23,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 11:27:23,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 11:27:23,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 11:27:23,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 11:27:23,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 11:27:23,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 11:27:23,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 11:27:23,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 11:27:23,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (1/1) ... [2021-08-27 11:27:23,582 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:27:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:27:23,597 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:27:23,618 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:27:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 11:27:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 11:27:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 11:27:23,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 11:27:24,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 11:27:24,320 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-27 11:27:24,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:27:24 BoogieIcfgContainer [2021-08-27 11:27:24,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 11:27:24,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 11:27:24,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 11:27:24,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 11:27:24,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:27:23" (1/3) ... [2021-08-27 11:27:24,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f91d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:27:24, skipping insertion in model container [2021-08-27 11:27:24,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:23" (2/3) ... [2021-08-27 11:27:24,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f91d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:27:24, skipping insertion in model container [2021-08-27 11:27:24,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:27:24" (3/3) ... [2021-08-27 11:27:24,328 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2021-08-27 11:27:24,332 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 11:27:24,332 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-08-27 11:27:24,369 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 11:27:24,381 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:27:24,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-08-27 11:27:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 112 states have (on average 1.7767857142857142) internal successors, (199), 150 states have internal predecessors, (199), 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:27:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 11:27:24,409 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:24,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:24,410 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1807791520, now seen corresponding path program 1 times [2021-08-27 11:27:24,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:24,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156965823] [2021-08-27 11:27:24,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:24,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:24,547 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:27:24,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:24,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156965823] [2021-08-27 11:27:24,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156965823] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:24,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:24,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 11:27:24,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29441379] [2021-08-27 11:27:24,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 11:27:24,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:24,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 11:27:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:27:24,575 INFO L87 Difference]: Start difference. First operand has 151 states, 112 states have (on average 1.7767857142857142) internal successors, (199), 150 states have internal predecessors, (199), 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, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:27:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:24,604 INFO L93 Difference]: Finished difference Result 280 states and 370 transitions. [2021-08-27 11:27:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 11:27:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2021-08-27 11:27:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:24,616 INFO L225 Difference]: With dead ends: 280 [2021-08-27 11:27:24,616 INFO L226 Difference]: Without dead ends: 131 [2021-08-27 11:27:24,619 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:27:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-27 11:27:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-08-27 11:27:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.597938144329897) internal successors, (155), 130 states have internal predecessors, (155), 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:27:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2021-08-27 11:27:24,674 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 7 [2021-08-27 11:27:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:24,675 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2021-08-27 11:27:24,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:27:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2021-08-27 11:27:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 11:27:24,677 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:24,677 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:24,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 11:27:24,678 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1806850254, now seen corresponding path program 1 times [2021-08-27 11:27:24,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:24,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425741002] [2021-08-27 11:27:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:24,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:24,757 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:27:24,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:24,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425741002] [2021-08-27 11:27:24,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425741002] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:24,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:24,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 11:27:24,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291377042] [2021-08-27 11:27:24,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:27:24,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:27:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:24,762 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:27:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:24,896 INFO L93 Difference]: Finished difference Result 259 states and 304 transitions. [2021-08-27 11:27:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:27:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2021-08-27 11:27:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:24,899 INFO L225 Difference]: With dead ends: 259 [2021-08-27 11:27:24,900 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 11:27:24,901 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 11:27:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2021-08-27 11:27:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 142 states have internal predecessors, (168), 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:27:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2021-08-27 11:27:24,913 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 7 [2021-08-27 11:27:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:24,914 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2021-08-27 11:27:24,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:27:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2021-08-27 11:27:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 11:27:24,915 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:24,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:24,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 11:27:24,916 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash -866677448, now seen corresponding path program 1 times [2021-08-27 11:27:24,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:24,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815043434] [2021-08-27 11:27:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:24,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:24,997 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:27:24,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:24,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815043434] [2021-08-27 11:27:24,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815043434] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:24,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:24,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:24,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427215755] [2021-08-27 11:27:24,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:24,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:25,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:25,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:25,002 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:27:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:25,110 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2021-08-27 11:27:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:25,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2021-08-27 11:27:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:25,113 INFO L225 Difference]: With dead ends: 220 [2021-08-27 11:27:25,113 INFO L226 Difference]: Without dead ends: 213 [2021-08-27 11:27:25,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-27 11:27:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 144. [2021-08-27 11:27:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 143 states have internal predecessors, (170), 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:27:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2021-08-27 11:27:25,133 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 10 [2021-08-27 11:27:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:25,134 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2021-08-27 11:27:25,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:27:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2021-08-27 11:27:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 11:27:25,135 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:25,135 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:25,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 11:27:25,136 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1097196978, now seen corresponding path program 1 times [2021-08-27 11:27:25,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:25,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282052808] [2021-08-27 11:27:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:25,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:25,189 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:27:25,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:25,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282052808] [2021-08-27 11:27:25,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282052808] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:25,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:25,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 11:27:25,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783969023] [2021-08-27 11:27:25,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:27:25,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:27:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:25,195 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:27:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:25,281 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2021-08-27 11:27:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:27:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-08-27 11:27:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:25,283 INFO L225 Difference]: With dead ends: 212 [2021-08-27 11:27:25,283 INFO L226 Difference]: Without dead ends: 207 [2021-08-27 11:27:25,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-27 11:27:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 136. [2021-08-27 11:27:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 135 states have internal predecessors, (162), 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:27:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2021-08-27 11:27:25,303 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 11 [2021-08-27 11:27:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:25,303 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2021-08-27 11:27:25,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:27:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2021-08-27 11:27:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 11:27:25,304 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:25,305 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:25,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 11:27:25,305 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:25,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1234080256, now seen corresponding path program 1 times [2021-08-27 11:27:25,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:25,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105120538] [2021-08-27 11:27:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:25,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:25,335 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:27:25,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:25,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105120538] [2021-08-27 11:27:25,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105120538] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:25,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:25,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:25,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369145918] [2021-08-27 11:27:25,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:25,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:25,338 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:27:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:25,427 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-08-27 11:27:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2021-08-27 11:27:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:25,429 INFO L225 Difference]: With dead ends: 208 [2021-08-27 11:27:25,429 INFO L226 Difference]: Without dead ends: 206 [2021-08-27 11:27:25,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-08-27 11:27:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 138. [2021-08-27 11:27:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 137 states have internal predecessors, (164), 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:27:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2021-08-27 11:27:25,453 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 12 [2021-08-27 11:27:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:25,454 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2021-08-27 11:27:25,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:27:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2021-08-27 11:27:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 11:27:25,455 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:25,455 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:25,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 11:27:25,455 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:25,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:25,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1595344206, now seen corresponding path program 1 times [2021-08-27 11:27:25,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:25,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883021558] [2021-08-27 11:27:25,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:25,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:25,515 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:27:25,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:25,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883021558] [2021-08-27 11:27:25,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883021558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:25,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:25,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:25,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960648709] [2021-08-27 11:27:25,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:25,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:25,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:25,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:25,518 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:27:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:25,614 INFO L93 Difference]: Finished difference Result 329 states and 382 transitions. [2021-08-27 11:27:25,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:25,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2021-08-27 11:27:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:25,622 INFO L225 Difference]: With dead ends: 329 [2021-08-27 11:27:25,622 INFO L226 Difference]: Without dead ends: 219 [2021-08-27 11:27:25,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-08-27 11:27:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 143. [2021-08-27 11:27:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 142 states have internal predecessors, (170), 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:27:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2021-08-27 11:27:25,641 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 12 [2021-08-27 11:27:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:25,642 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2021-08-27 11:27:25,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:27:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2021-08-27 11:27:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 11:27:25,642 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:25,643 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:25,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 11:27:25,643 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2056836231, now seen corresponding path program 1 times [2021-08-27 11:27:25,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:25,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240977234] [2021-08-27 11:27:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:25,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:25,675 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:27:25,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:25,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240977234] [2021-08-27 11:27:25,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240977234] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:25,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:25,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:25,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592358717] [2021-08-27 11:27:25,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:25,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:25,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:25,677 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:27:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:25,741 INFO L93 Difference]: Finished difference Result 217 states and 253 transitions. [2021-08-27 11:27:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:27:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:25,743 INFO L225 Difference]: With dead ends: 217 [2021-08-27 11:27:25,743 INFO L226 Difference]: Without dead ends: 215 [2021-08-27 11:27:25,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-27 11:27:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 146. [2021-08-27 11:27:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 145 states have internal predecessors, (174), 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:27:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2021-08-27 11:27:25,750 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 13 [2021-08-27 11:27:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:25,751 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2021-08-27 11:27:25,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:27:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2021-08-27 11:27:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 11:27:25,752 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:25,752 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:25,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 11:27:25,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash 465285246, now seen corresponding path program 1 times [2021-08-27 11:27:25,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:25,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879521848] [2021-08-27 11:27:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:25,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:25,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:25,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879521848] [2021-08-27 11:27:25,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879521848] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:27:25,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907197808] [2021-08-27 11:27:25,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:25,784 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:27:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:27:25,785 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:27:25,789 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:27:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:25,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 11:27:25,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:27:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:25,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907197808] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:25,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:27:25,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-08-27 11:27:25,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467088096] [2021-08-27 11:27:25,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:25,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:27:25,906 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:27:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:25,997 INFO L93 Difference]: Finished difference Result 281 states and 324 transitions. [2021-08-27 11:27:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:25,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:27:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:25,999 INFO L225 Difference]: With dead ends: 281 [2021-08-27 11:27:25,999 INFO L226 Difference]: Without dead ends: 278 [2021-08-27 11:27:26,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:27:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-27 11:27:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 133. [2021-08-27 11:27:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.407079646017699) internal successors, (159), 132 states have internal predecessors, (159), 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:27:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2021-08-27 11:27:26,009 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 13 [2021-08-27 11:27:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:26,009 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2021-08-27 11:27:26,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:27:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2021-08-27 11:27:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 11:27:26,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:26,013 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:26,034 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:27:26,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:27:26,221 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash -793504392, now seen corresponding path program 1 times [2021-08-27 11:27:26,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:26,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560718891] [2021-08-27 11:27:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:26,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:26,297 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:27:26,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:26,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560718891] [2021-08-27 11:27:26,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560718891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:26,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:26,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:26,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268349590] [2021-08-27 11:27:26,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:26,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:26,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:26,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:26,300 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:27:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:26,548 INFO L93 Difference]: Finished difference Result 293 states and 344 transitions. [2021-08-27 11:27:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 11:27:26,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2021-08-27 11:27:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:26,549 INFO L225 Difference]: With dead ends: 293 [2021-08-27 11:27:26,550 INFO L226 Difference]: Without dead ends: 219 [2021-08-27 11:27:26,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 128.9ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 11:27:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-08-27 11:27:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 177. [2021-08-27 11:27:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.375796178343949) internal successors, (216), 176 states have internal predecessors, (216), 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:27:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 216 transitions. [2021-08-27 11:27:26,560 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 216 transitions. Word has length 15 [2021-08-27 11:27:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:26,561 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 216 transitions. [2021-08-27 11:27:26,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:27:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 216 transitions. [2021-08-27 11:27:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 11:27:26,563 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:26,564 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:26,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 11:27:26,564 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash -47207071, now seen corresponding path program 1 times [2021-08-27 11:27:26,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:26,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931984961] [2021-08-27 11:27:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:26,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:26,632 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:27:26,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:26,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931984961] [2021-08-27 11:27:26,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931984961] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:26,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:26,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:26,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739760270] [2021-08-27 11:27:26,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:26,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:26,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:26,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:26,636 INFO L87 Difference]: Start difference. First operand 177 states and 216 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:27:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:26,702 INFO L93 Difference]: Finished difference Result 284 states and 338 transitions. [2021-08-27 11:27:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2021-08-27 11:27:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:26,704 INFO L225 Difference]: With dead ends: 284 [2021-08-27 11:27:26,704 INFO L226 Difference]: Without dead ends: 282 [2021-08-27 11:27:26,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-27 11:27:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 182. [2021-08-27 11:27:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 181 states have internal predecessors, (220), 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:27:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 220 transitions. [2021-08-27 11:27:26,714 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 220 transitions. Word has length 15 [2021-08-27 11:27:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:26,714 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 220 transitions. [2021-08-27 11:27:26,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:27:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 220 transitions. [2021-08-27 11:27:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 11:27:26,715 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:26,715 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:26,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 11:27:26,715 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1418335763, now seen corresponding path program 1 times [2021-08-27 11:27:26,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:26,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470019502] [2021-08-27 11:27:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:26,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:26,739 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:27:26,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:26,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470019502] [2021-08-27 11:27:26,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470019502] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:26,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:26,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:26,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325540655] [2021-08-27 11:27:26,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:26,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:26,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:26,742 INFO L87 Difference]: Start difference. First operand 182 states and 220 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:27:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:26,817 INFO L93 Difference]: Finished difference Result 373 states and 439 transitions. [2021-08-27 11:27:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:26,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2021-08-27 11:27:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:26,819 INFO L225 Difference]: With dead ends: 373 [2021-08-27 11:27:26,819 INFO L226 Difference]: Without dead ends: 370 [2021-08-27 11:27:26,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-27 11:27:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 167. [2021-08-27 11:27:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 166 states have internal predecessors, (204), 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:27:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2021-08-27 11:27:26,829 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 15 [2021-08-27 11:27:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:26,829 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2021-08-27 11:27:26,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:27:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2021-08-27 11:27:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 11:27:26,830 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:26,830 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] [2021-08-27 11:27:26,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 11:27:26,831 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1101296279, now seen corresponding path program 1 times [2021-08-27 11:27:26,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:26,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921820664] [2021-08-27 11:27:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:26,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:26,928 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:27:26,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:26,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921820664] [2021-08-27 11:27:26,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921820664] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:26,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:26,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 11:27:26,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544381003] [2021-08-27 11:27:26,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:27:26,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:27:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:27:26,935 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:27:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:27,105 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2021-08-27 11:27:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:27:27,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2021-08-27 11:27:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:27,107 INFO L225 Difference]: With dead ends: 286 [2021-08-27 11:27:27,108 INFO L226 Difference]: Without dead ends: 285 [2021-08-27 11:27:27,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-08-27 11:27:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 183. [2021-08-27 11:27:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 182 states have internal predecessors, (223), 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:27:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2021-08-27 11:27:27,119 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 223 transitions. Word has length 21 [2021-08-27 11:27:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:27,119 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 223 transitions. [2021-08-27 11:27:27,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:27:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 223 transitions. [2021-08-27 11:27:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:27,120 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:27,121 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:27:27,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 11:27:27,121 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:27,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1783760243, now seen corresponding path program 1 times [2021-08-27 11:27:27,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:27,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68736876] [2021-08-27 11:27:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:27,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:27,328 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:27:27,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:27,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68736876] [2021-08-27 11:27:27,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68736876] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:27,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:27,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:27,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340611914] [2021-08-27 11:27:27,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 11:27:27,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 11:27:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:27,330 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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:27:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:27,726 INFO L93 Difference]: Finished difference Result 338 states and 391 transitions. [2021-08-27 11:27:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 11:27:27,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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:27:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:27,728 INFO L225 Difference]: With dead ends: 338 [2021-08-27 11:27:27,728 INFO L226 Difference]: Without dead ends: 335 [2021-08-27 11:27:27,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 147.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-08-27 11:27:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-08-27 11:27:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 209. [2021-08-27 11:27:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 193 states have (on average 1.3212435233160622) internal successors, (255), 208 states have internal predecessors, (255), 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:27:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 255 transitions. [2021-08-27 11:27:27,741 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 255 transitions. Word has length 23 [2021-08-27 11:27:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:27,741 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 255 transitions. [2021-08-27 11:27:27,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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:27:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 255 transitions. [2021-08-27 11:27:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:27,742 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:27,742 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:27:27,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 11:27:27,742 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash 685438419, now seen corresponding path program 1 times [2021-08-27 11:27:27,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:27,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887196446] [2021-08-27 11:27:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:27,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:27,833 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:27:27,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:27,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887196446] [2021-08-27 11:27:27,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887196446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:27,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:27,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:27,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739056080] [2021-08-27 11:27:27,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:27,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:27,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:27,835 INFO L87 Difference]: Start difference. First operand 209 states and 255 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:27:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:27,916 INFO L93 Difference]: Finished difference Result 249 states and 289 transitions. [2021-08-27 11:27:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:27:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:27:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:27,918 INFO L225 Difference]: With dead ends: 249 [2021-08-27 11:27:27,918 INFO L226 Difference]: Without dead ends: 181 [2021-08-27 11:27:27,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 41.3ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:27:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-27 11:27:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2021-08-27 11:27:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 132 states have (on average 1.356060606060606) internal successors, (179), 147 states have internal predecessors, (179), 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:27:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2021-08-27 11:27:27,926 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 23 [2021-08-27 11:27:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:27,927 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2021-08-27 11:27:27,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:27:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2021-08-27 11:27:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:27,928 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:27,928 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:27:27,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 11:27:27,928 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1121574605, now seen corresponding path program 1 times [2021-08-27 11:27:27,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:27,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940683616] [2021-08-27 11:27:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:27,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:27,990 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:27:27,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:27,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940683616] [2021-08-27 11:27:27,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940683616] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:27,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:27,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:27,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461544589] [2021-08-27 11:27:27,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:27,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:27,993 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:27:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:28,102 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-08-27 11:27:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:27:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:27:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:28,104 INFO L225 Difference]: With dead ends: 208 [2021-08-27 11:27:28,104 INFO L226 Difference]: Without dead ends: 180 [2021-08-27 11:27:28,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 42.6ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:27:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-27 11:27:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 154. [2021-08-27 11:27:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 153 states have internal predecessors, (185), 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:27:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2021-08-27 11:27:28,113 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 23 [2021-08-27 11:27:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:28,113 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2021-08-27 11:27:28,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:27:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2021-08-27 11:27:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:28,114 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:28,114 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:27:28,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 11:27:28,115 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash -322402664, now seen corresponding path program 1 times [2021-08-27 11:27:28,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:28,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479915766] [2021-08-27 11:27:28,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:28,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:28,198 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:27:28,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:28,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479915766] [2021-08-27 11:27:28,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479915766] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:28,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:28,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:27:28,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593948384] [2021-08-27 11:27:28,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:28,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:28,201 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:27:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:28,371 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2021-08-27 11:27:28,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:27:28,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:27:28,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:28,372 INFO L225 Difference]: With dead ends: 261 [2021-08-27 11:27:28,372 INFO L226 Difference]: Without dead ends: 229 [2021-08-27 11:27:28,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 64.1ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:27:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-08-27 11:27:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 157. [2021-08-27 11:27:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 156 states have internal predecessors, (188), 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:27:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 188 transitions. [2021-08-27 11:27:28,385 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 188 transitions. Word has length 23 [2021-08-27 11:27:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:28,385 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 188 transitions. [2021-08-27 11:27:28,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:27:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 188 transitions. [2021-08-27 11:27:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:28,388 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:28,388 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:27:28,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 11:27:28,388 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash -322343082, now seen corresponding path program 1 times [2021-08-27 11:27:28,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:28,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86329855] [2021-08-27 11:27:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:28,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:28,482 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:27:28,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:28,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86329855] [2021-08-27 11:27:28,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86329855] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:28,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:28,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:27:28,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701983776] [2021-08-27 11:27:28,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:28,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:28,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:28,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:28,485 INFO L87 Difference]: Start difference. First operand 157 states and 188 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:27:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:28,679 INFO L93 Difference]: Finished difference Result 425 states and 485 transitions. [2021-08-27 11:27:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 11:27:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:27:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:28,682 INFO L225 Difference]: With dead ends: 425 [2021-08-27 11:27:28,682 INFO L226 Difference]: Without dead ends: 424 [2021-08-27 11:27:28,683 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 89.7ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:27:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-08-27 11:27:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 183. [2021-08-27 11:27:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 167 states have (on average 1.3293413173652695) internal successors, (222), 182 states have internal predecessors, (222), 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:27:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2021-08-27 11:27:28,702 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 23 [2021-08-27 11:27:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:28,703 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2021-08-27 11:27:28,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:27:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2021-08-27 11:27:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 11:27:28,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:28,704 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] [2021-08-27 11:27:28,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 11:27:28,704 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash -146326323, now seen corresponding path program 1 times [2021-08-27 11:27:28,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:28,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863836212] [2021-08-27 11:27:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:28,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:28,816 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:27:28,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:28,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863836212] [2021-08-27 11:27:28,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863836212] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:28,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:28,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:27:28,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483589017] [2021-08-27 11:27:28,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:28,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:28,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:28,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:28,820 INFO L87 Difference]: Start difference. First operand 183 states and 222 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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:27:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:29,024 INFO L93 Difference]: Finished difference Result 465 states and 521 transitions. [2021-08-27 11:27:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 11:27:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2021-08-27 11:27:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:29,026 INFO L225 Difference]: With dead ends: 465 [2021-08-27 11:27:29,026 INFO L226 Difference]: Without dead ends: 464 [2021-08-27 11:27:29,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 97.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-08-27 11:27:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-27 11:27:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 239. [2021-08-27 11:27:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 223 states have (on average 1.3318385650224216) internal successors, (297), 238 states have internal predecessors, (297), 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:27:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 297 transitions. [2021-08-27 11:27:29,042 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 297 transitions. Word has length 25 [2021-08-27 11:27:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:29,043 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 297 transitions. [2021-08-27 11:27:29,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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:27:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 297 transitions. [2021-08-27 11:27:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 11:27:29,044 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:29,044 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] [2021-08-27 11:27:29,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 11:27:29,044 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash -591306022, now seen corresponding path program 1 times [2021-08-27 11:27:29,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:29,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418902624] [2021-08-27 11:27:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:29,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:29,144 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:27:29,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:29,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418902624] [2021-08-27 11:27:29,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418902624] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:29,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:29,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:29,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167542934] [2021-08-27 11:27:29,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 11:27:29,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 11:27:29,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:29,147 INFO L87 Difference]: Start difference. First operand 239 states and 297 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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:27:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:29,505 INFO L93 Difference]: Finished difference Result 498 states and 555 transitions. [2021-08-27 11:27:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 11:27:29,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 25 [2021-08-27 11:27:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:29,508 INFO L225 Difference]: With dead ends: 498 [2021-08-27 11:27:29,508 INFO L226 Difference]: Without dead ends: 431 [2021-08-27 11:27:29,508 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 144.2ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-08-27 11:27:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-08-27 11:27:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 236. [2021-08-27 11:27:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 235 states have internal predecessors, (290), 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:27:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 290 transitions. [2021-08-27 11:27:29,527 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 290 transitions. Word has length 25 [2021-08-27 11:27:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:29,528 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 290 transitions. [2021-08-27 11:27:29,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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:27:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 290 transitions. [2021-08-27 11:27:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 11:27:29,528 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:29,529 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] [2021-08-27 11:27:29,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 11:27:29,529 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1716642380, now seen corresponding path program 1 times [2021-08-27 11:27:29,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:29,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191090133] [2021-08-27 11:27:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:29,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:29,682 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:27:29,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:29,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191090133] [2021-08-27 11:27:29,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191090133] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:29,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:29,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:29,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695042318] [2021-08-27 11:27:29,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 11:27:29,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:29,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 11:27:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:29,685 INFO L87 Difference]: Start difference. First operand 236 states and 290 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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:27:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:30,032 INFO L93 Difference]: Finished difference Result 320 states and 381 transitions. [2021-08-27 11:27:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:27:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 25 [2021-08-27 11:27:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:30,034 INFO L225 Difference]: With dead ends: 320 [2021-08-27 11:27:30,034 INFO L226 Difference]: Without dead ends: 319 [2021-08-27 11:27:30,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 174.0ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:27:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-08-27 11:27:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 236. [2021-08-27 11:27:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 220 states have (on average 1.3136363636363637) internal successors, (289), 235 states have internal predecessors, (289), 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:27:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 289 transitions. [2021-08-27 11:27:30,050 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 289 transitions. Word has length 25 [2021-08-27 11:27:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:30,050 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 289 transitions. [2021-08-27 11:27:30,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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:27:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 289 transitions. [2021-08-27 11:27:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 11:27:30,051 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:30,051 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] [2021-08-27 11:27:30,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 11:27:30,051 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1114335921, now seen corresponding path program 1 times [2021-08-27 11:27:30,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:30,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603593383] [2021-08-27 11:27:30,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:30,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:30,133 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:27:30,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:30,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603593383] [2021-08-27 11:27:30,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603593383] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:30,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:30,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:30,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908554928] [2021-08-27 11:27:30,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:30,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:30,136 INFO L87 Difference]: Start difference. First operand 236 states and 289 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:27:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:30,232 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2021-08-27 11:27:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:27:30,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2021-08-27 11:27:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:30,234 INFO L225 Difference]: With dead ends: 264 [2021-08-27 11:27:30,234 INFO L226 Difference]: Without dead ends: 218 [2021-08-27 11:27:30,235 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:27:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-08-27 11:27:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2021-08-27 11:27:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 200 states have (on average 1.325) internal successors, (265), 215 states have internal predecessors, (265), 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:27:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 265 transitions. [2021-08-27 11:27:30,252 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 265 transitions. Word has length 27 [2021-08-27 11:27:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:30,253 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 265 transitions. [2021-08-27 11:27:30,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:27:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2021-08-27 11:27:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 11:27:30,254 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:30,254 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] [2021-08-27 11:27:30,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 11:27:30,254 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash 350457026, now seen corresponding path program 1 times [2021-08-27 11:27:30,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:30,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267325773] [2021-08-27 11:27:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:30,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:27:30,285 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 11:27:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:27:30,323 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 11:27:30,323 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 11:27:30,324 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:30,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 11:27:30,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 11:27:30,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 11:27:30 BoogieIcfgContainer [2021-08-27 11:27:30,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 11:27:30,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 11:27:30,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 11:27:30,377 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 11:27:30,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:27:24" (3/4) ... [2021-08-27 11:27:30,380 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 11:27:30,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 11:27:30,381 INFO L168 Benchmark]: Toolchain (without parser) took 7198.16 ms. Allocated memory was 50.3 MB in the beginning and 157.3 MB in the end (delta: 107.0 MB). Free memory was 27.0 MB in the beginning and 64.6 MB in the end (delta: -37.6 MB). Peak memory consumption was 69.0 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:30,381 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 38.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:27:30,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.94 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.7 MB in the beginning and 42.2 MB in the end (delta: -15.5 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:30,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.57 ms. Allocated memory is still 60.8 MB. Free memory was 42.2 MB in the beginning and 39.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:30,391 INFO L168 Benchmark]: Boogie Preprocessor took 38.39 ms. Allocated memory is still 60.8 MB. Free memory was 39.6 MB in the beginning and 38.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:30,392 INFO L168 Benchmark]: RCFGBuilder took 746.45 ms. Allocated memory is still 60.8 MB. Free memory was 37.8 MB in the beginning and 31.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:30,392 INFO L168 Benchmark]: TraceAbstraction took 6052.48 ms. Allocated memory was 60.8 MB in the beginning and 157.3 MB in the end (delta: 96.5 MB). Free memory was 30.7 MB in the beginning and 64.6 MB in the end (delta: -33.9 MB). Peak memory consumption was 62.8 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:30,392 INFO L168 Benchmark]: Witness Printer took 3.57 ms. Allocated memory is still 157.3 MB. Free memory was 64.6 MB in the beginning and 64.6 MB in the end (delta: 2.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:27:30,394 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.14 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 38.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 297.94 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.7 MB in the beginning and 42.2 MB in the end (delta: -15.5 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.57 ms. Allocated memory is still 60.8 MB. Free memory was 42.2 MB in the beginning and 39.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.39 ms. Allocated memory is still 60.8 MB. Free memory was 39.6 MB in the beginning and 38.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 746.45 ms. Allocated memory is still 60.8 MB. Free memory was 37.8 MB in the beginning and 31.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6052.48 ms. Allocated memory was 60.8 MB in the beginning and 157.3 MB in the end (delta: 96.5 MB). Free memory was 30.7 MB in the beginning and 64.6 MB in the end (delta: -33.9 MB). Peak memory consumption was 62.8 MB. Max. memory is 16.1 GB. * Witness Printer took 3.57 ms. Allocated memory is still 157.3 MB. Free memory was 64.6 MB in the beginning and 64.6 MB in the end (delta: 2.6 kB). 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: 105]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 103, overapproximation of bitwiseAnd at line 104. Possible FailurePath: [L219] unsigned int a ; [L220] unsigned int ma = __VERIFIER_nondet_uint(); [L221] signed char ea = __VERIFIER_nondet_char(); [L222] unsigned int b ; [L223] unsigned int mb = __VERIFIER_nondet_uint(); [L224] signed char eb = __VERIFIER_nondet_char(); [L225] unsigned int r_add1 ; [L226] unsigned int r_add2 ; [L227] unsigned int zero ; [L228] int tmp ; [L229] int tmp___0 ; [L230] int __retres14 ; [L18] unsigned int res ; [L19] unsigned int __retres4 ; [L22] COND TRUE ! m [L23] __retres4 = 0U [L73] return (__retres4); [L234] zero = base2flt(0, 0) [L18] unsigned int res ; [L19] unsigned int __retres4 ; [L22] COND FALSE !(! m) [L28] COND FALSE !(m < 1U << 24U) [L50] COND TRUE 1 [L52] COND TRUE m >= 1U << 25U [L57] COND TRUE e >= 127 [L58] __retres4 = 4294967295U [L73] return (__retres4); [L235] a = base2flt(ma, ea) [L18] unsigned int res ; [L19] unsigned int __retres4 ; [L22] COND FALSE !(! m) [L28] COND FALSE !(m < 1U << 24U) [L50] COND TRUE 1 [L52] COND FALSE !(m >= 1U << 25U) [L69] m = m & ~ (1U << 24U) [L70] EXPR e + 128 [L70] res = m | ((unsigned int )(e + 128) << 24U) [L71] __retres4 = res [L73] return (__retres4); [L236] b = base2flt(mb, eb) [L77] unsigned int res ; [L78] unsigned int ma ; [L79] unsigned int mb ; [L80] unsigned int delta ; [L81] int ea ; [L82] int eb ; [L83] unsigned int tmp ; [L84] unsigned int __retres10 ; [L87] COND FALSE !(a < b) [L94] COND FALSE !(! b) [L101] ma = a & ((1U << 24U) - 1U) [L102] EXPR (int )(a >> 24U) - 128 [L102] ea = (int )(a >> 24U) - 128 [L103] ma = ma | (1U << 24U) [L104] mb = b & ((1U << 24U) - 1U) [L105] (int )(b >> 24U) - 128 - UnprovableResult [Line: 38]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: 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: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: 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: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: 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, 151 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 5971.0ms, OverallIterations: 22, TraceHistogramMax: 2, EmptinessCheckTime: 30.9ms, AutomataDifference: 3323.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3485 SDtfs, 4951 SDslu, 8063 SDs, 0 SdLazy, 1849 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1586.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1109.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=18, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 315.6ms AutomataMinimizationTime, 21 MinimizatonAttempts, 1950 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.9ms SsaConstructionTime, 275.6ms SatisfiabilityAnalysisTime, 1420.2ms InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 1469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 66 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 2/4 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:27:30,414 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...