./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 08:46:49,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 08:46:49,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 08:46:49,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 08:46:49,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 08:46:49,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 08:46:49,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 08:46:49,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 08:46:49,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 08:46:49,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 08:46:49,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 08:46:49,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 08:46:49,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 08:46:49,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 08:46:49,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 08:46:49,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 08:46:49,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 08:46:49,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 08:46:49,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 08:46:49,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 08:46:49,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 08:46:49,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 08:46:49,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 08:46:49,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 08:46:49,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 08:46:49,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 08:46:49,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 08:46:49,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 08:46:49,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 08:46:49,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 08:46:49,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 08:46:49,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 08:46:49,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 08:46:49,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 08:46:49,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 08:46:49,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 08:46:49,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 08:46:49,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 08:46:49,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 08:46:49,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 08:46:49,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 08:46:49,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-28 08:46:49,877 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 08:46:49,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 08:46:49,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 08:46:49,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 08:46:49,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 08:46:49,879 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 08:46:49,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 08:46:49,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 08:46:49,880 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 08:46:49,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 08:46:49,881 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 08:46:49,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 08:46:49,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 08:46:49,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 08:46:49,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 08:46:49,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 08:46:49,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 08:46:49,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 08:46:49,882 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-28 08:46:49,882 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 08:46:49,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 08:46:49,883 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 08:46:49,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 08:46:49,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 08:46:49,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 08:46:49,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 08:46:49,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:46:49,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 08:46:49,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 08:46:49,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 08:46:49,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 08:46:49,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 08:46:49,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 08:46:49,885 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2021-12-28 08:46:50,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 08:46:50,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 08:46:50,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 08:46:50,153 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 08:46:50,158 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 08:46:50,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-12-28 08:46:50,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7b67691/1171aee4296c49a9a92ee9182d8a0c2e/FLAG6d39a1d21 [2021-12-28 08:46:50,567 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 08:46:50,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-12-28 08:46:50,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7b67691/1171aee4296c49a9a92ee9182d8a0c2e/FLAG6d39a1d21 [2021-12-28 08:46:50,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7b67691/1171aee4296c49a9a92ee9182d8a0c2e [2021-12-28 08:46:50,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 08:46:50,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 08:46:50,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 08:46:50,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 08:46:50,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 08:46:50,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:46:50" (1/1) ... [2021-12-28 08:46:50,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1392a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:50, skipping insertion in model container [2021-12-28 08:46:50,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:46:50" (1/1) ... [2021-12-28 08:46:50,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 08:46:50,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 08:46:51,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2021-12-28 08:46:51,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:46:51,118 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 08:46:51,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2021-12-28 08:46:51,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:46:51,184 INFO L208 MainTranslator]: Completed translation [2021-12-28 08:46:51,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51 WrapperNode [2021-12-28 08:46:51,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 08:46:51,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 08:46:51,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 08:46:51,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 08:46:51,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,212 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2021-12-28 08:46:51,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 08:46:51,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 08:46:51,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 08:46:51,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 08:46:51,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 08:46:51,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 08:46:51,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 08:46:51,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 08:46:51,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (1/1) ... [2021-12-28 08:46:51,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:46:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:46:51,297 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-12-28 08:46:51,308 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-12-28 08:46:51,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 08:46:51,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 08:46:51,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 08:46:51,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 08:46:51,371 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 08:46:51,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 08:46:51,534 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 08:46:51,539 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 08:46:51,539 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 08:46:51,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 08:46:51 BoogieIcfgContainer [2021-12-28 08:46:51,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 08:46:51,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 08:46:51,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 08:46:51,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 08:46:51,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 08:46:50" (1/3) ... [2021-12-28 08:46:51,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58abf786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 08:46:51, skipping insertion in model container [2021-12-28 08:46:51,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:46:51" (2/3) ... [2021-12-28 08:46:51,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58abf786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 08:46:51, skipping insertion in model container [2021-12-28 08:46:51,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 08:46:51" (3/3) ... [2021-12-28 08:46:51,545 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2021-12-28 08:46:51,548 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 08:46:51,549 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-12-28 08:46:51,576 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 08:46:51,580 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, mAutomataTypeConcurrency=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-12-28 08:46:51,581 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-12-28 08:46:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-28 08:46:51,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:51,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-28 08:46:51,602 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-12-28 08:46:51,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:51,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673232818] [2021-12-28 08:46:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:51,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:46:51,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:51,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673232818] [2021-12-28 08:46:51,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673232818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:51,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:51,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-28 08:46:51,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508448073] [2021-12-28 08:46:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:51,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 08:46:51,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 08:46:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 08:46:51,756 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:51,771 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-28 08:46:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 08:46:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-28 08:46:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:51,780 INFO L225 Difference]: With dead ends: 135 [2021-12-28 08:46:51,780 INFO L226 Difference]: Without dead ends: 69 [2021-12-28 08:46:51,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 08:46:51,786 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:51,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 08:46:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-28 08:46:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-28 08:46:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-12-28 08:46:51,811 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-12-28 08:46:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:51,811 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-12-28 08:46:51,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-12-28 08:46:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 08:46:51,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:51,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:51,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 08:46:51,814 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-12-28 08:46:51,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:51,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566236063] [2021-12-28 08:46:51,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:51,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:46:51,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:51,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566236063] [2021-12-28 08:46:51,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566236063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:51,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:51,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:46:51,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396902270] [2021-12-28 08:46:51,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:51,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:46:51,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:51,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:46:51,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:51,884 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:51,970 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-12-28 08:46:51,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:46:51,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-28 08:46:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:51,971 INFO L225 Difference]: With dead ends: 145 [2021-12-28 08:46:51,971 INFO L226 Difference]: Without dead ends: 98 [2021-12-28 08:46:51,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:51,973 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:51,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 121 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:46:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-28 08:46:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-28 08:46:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-12-28 08:46:51,980 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-12-28 08:46:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:51,980 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-12-28 08:46:51,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-12-28 08:46:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 08:46:51,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:51,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:51,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 08:46:51,982 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-12-28 08:46:51,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:51,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816549384] [2021-12-28 08:46:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:51,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 08:46:52,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:52,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816549384] [2021-12-28 08:46:52,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816549384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:52,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:52,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 08:46:52,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150707146] [2021-12-28 08:46:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:52,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:46:52,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:46:52,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:46:52,084 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:52,209 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-12-28 08:46:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:46:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-28 08:46:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:52,211 INFO L225 Difference]: With dead ends: 221 [2021-12-28 08:46:52,211 INFO L226 Difference]: Without dead ends: 164 [2021-12-28 08:46:52,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:46:52,212 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:52,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 281 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:46:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-28 08:46:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-12-28 08:46:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-12-28 08:46:52,220 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-12-28 08:46:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:52,220 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-12-28 08:46:52,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-12-28 08:46:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 08:46:52,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:52,221 INFO L514 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-12-28 08:46:52,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 08:46:52,222 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-12-28 08:46:52,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:52,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742097965] [2021-12-28 08:46:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:52,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 08:46:52,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742097965] [2021-12-28 08:46:52,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742097965] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:52,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:52,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 08:46:52,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898691089] [2021-12-28 08:46:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:52,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:46:52,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:46:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:46:52,294 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-12-28 08:46:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:52,418 INFO L93 Difference]: Finished difference Result 259 states and 340 transitions. [2021-12-28 08:46:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:46:52,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-12-28 08:46:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:52,419 INFO L225 Difference]: With dead ends: 259 [2021-12-28 08:46:52,419 INFO L226 Difference]: Without dead ends: 194 [2021-12-28 08:46:52,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:46:52,421 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:52,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 291 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:46:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-28 08:46:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2021-12-28 08:46:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 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-12-28 08:46:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2021-12-28 08:46:52,428 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 23 [2021-12-28 08:46:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:52,428 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2021-12-28 08:46:52,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-12-28 08:46:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2021-12-28 08:46:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 08:46:52,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:52,429 INFO L514 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] [2021-12-28 08:46:52,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 08:46:52,430 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2113419709, now seen corresponding path program 1 times [2021-12-28 08:46:52,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:52,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416922962] [2021-12-28 08:46:52,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:52,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 08:46:52,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416922962] [2021-12-28 08:46:52,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416922962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:52,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:52,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:46:52,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945609342] [2021-12-28 08:46:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:52,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:46:52,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:46:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:52,476 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12-28 08:46:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:52,481 INFO L93 Difference]: Finished difference Result 192 states and 248 transitions. [2021-12-28 08:46:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:46:52,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2021-12-28 08:46:52,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:52,482 INFO L225 Difference]: With dead ends: 192 [2021-12-28 08:46:52,482 INFO L226 Difference]: Without dead ends: 91 [2021-12-28 08:46:52,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:52,483 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:52,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 08:46:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-28 08:46:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-28 08:46:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 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-12-28 08:46:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2021-12-28 08:46:52,495 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 26 [2021-12-28 08:46:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:52,495 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2021-12-28 08:46:52,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12-28 08:46:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2021-12-28 08:46:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-28 08:46:52,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:52,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:52,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 08:46:52,497 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1291653624, now seen corresponding path program 1 times [2021-12-28 08:46:52,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:52,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122455560] [2021-12-28 08:46:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:52,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:46:52,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122455560] [2021-12-28 08:46:52,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122455560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:52,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:52,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:46:52,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713638601] [2021-12-28 08:46:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:52,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:46:52,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:52,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:46:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:52,543 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:52,556 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2021-12-28 08:46:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:46:52,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-28 08:46:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:52,557 INFO L225 Difference]: With dead ends: 115 [2021-12-28 08:46:52,557 INFO L226 Difference]: Without dead ends: 102 [2021-12-28 08:46:52,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:52,561 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:52,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 08:46:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-28 08:46:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-28 08:46:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 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-12-28 08:46:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2021-12-28 08:46:52,573 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 32 [2021-12-28 08:46:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:52,574 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-12-28 08:46:52,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2021-12-28 08:46:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-28 08:46:52,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:52,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:52,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 08:46:52,578 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:52,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 280536374, now seen corresponding path program 1 times [2021-12-28 08:46:52,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:52,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802543423] [2021-12-28 08:46:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:52,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:46:52,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:52,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802543423] [2021-12-28 08:46:52,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802543423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:46:52,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031767696] [2021-12-28 08:46:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:52,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:52,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:46:52,634 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-12-28 08:46:52,635 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-12-28 08:46:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:52,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:46:52,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:46:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:46:52,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:46:52,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031767696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:52,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 08:46:52,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-28 08:46:52,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238168997] [2021-12-28 08:46:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:52,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:46:52,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:46:52,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 08:46:52,811 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:52,923 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2021-12-28 08:46:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:46:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-28 08:46:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:52,924 INFO L225 Difference]: With dead ends: 218 [2021-12-28 08:46:52,924 INFO L226 Difference]: Without dead ends: 164 [2021-12-28 08:46:52,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 08:46:52,925 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:52,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:46:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-28 08:46:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2021-12-28 08:46:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.25) internal successors, (170), 136 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-12-28 08:46:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-12-28 08:46:52,930 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 32 [2021-12-28 08:46:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:52,930 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-12-28 08:46:52,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-12-28 08:46:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 08:46:52,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:52,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:52,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 08:46:53,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:53,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1198830924, now seen corresponding path program 1 times [2021-12-28 08:46:53,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:53,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371598633] [2021-12-28 08:46:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:53,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:46:53,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371598633] [2021-12-28 08:46:53,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371598633] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:46:53,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823757521] [2021-12-28 08:46:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:53,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:46:53,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 08:46:53,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 08:46:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:53,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:46:53,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:46:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 08:46:53,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:46:53,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823757521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:53,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 08:46:53,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-28 08:46:53,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060841293] [2021-12-28 08:46:53,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:53,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:46:53,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:53,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:46:53,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:46:53,399 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:53,531 INFO L93 Difference]: Finished difference Result 315 states and 423 transitions. [2021-12-28 08:46:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:46:53,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-28 08:46:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:53,533 INFO L225 Difference]: With dead ends: 315 [2021-12-28 08:46:53,533 INFO L226 Difference]: Without dead ends: 205 [2021-12-28 08:46:53,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:46:53,536 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:53,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:46:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-28 08:46:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 169. [2021-12-28 08:46:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2261904761904763) internal successors, (206), 168 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2021-12-28 08:46:53,552 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 39 [2021-12-28 08:46:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:53,552 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2021-12-28 08:46:53,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2021-12-28 08:46:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 08:46:53,555 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:53,556 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:53,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 08:46:53,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-28 08:46:53,769 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2073059654, now seen corresponding path program 1 times [2021-12-28 08:46:53,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:53,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513817795] [2021-12-28 08:46:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:53,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 08:46:53,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513817795] [2021-12-28 08:46:53,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513817795] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:46:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846685002] [2021-12-28 08:46:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:53,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:53,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:46:53,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 08:46:53,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 08:46:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:53,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:46:53,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:46:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 08:46:53,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:46:53,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846685002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:53,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 08:46:53,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-28 08:46:53,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391170897] [2021-12-28 08:46:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:53,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:46:53,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:53,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:46:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:46:53,976 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-12-28 08:46:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:54,082 INFO L93 Difference]: Finished difference Result 380 states and 494 transitions. [2021-12-28 08:46:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:46:54,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 46 [2021-12-28 08:46:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:54,084 INFO L225 Difference]: With dead ends: 380 [2021-12-28 08:46:54,085 INFO L226 Difference]: Without dead ends: 238 [2021-12-28 08:46:54,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:46:54,088 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:54,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 172 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:46:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-28 08:46:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 201. [2021-12-28 08:46:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.21) internal successors, (242), 200 states have internal predecessors, (242), 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-12-28 08:46:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 242 transitions. [2021-12-28 08:46:54,096 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 242 transitions. Word has length 46 [2021-12-28 08:46:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:54,098 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 242 transitions. [2021-12-28 08:46:54,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-12-28 08:46:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 242 transitions. [2021-12-28 08:46:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-28 08:46:54,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:54,101 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:54,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 08:46:54,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:54,333 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:54,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1645599792, now seen corresponding path program 1 times [2021-12-28 08:46:54,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626821757] [2021-12-28 08:46:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:54,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 08:46:54,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:54,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626821757] [2021-12-28 08:46:54,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626821757] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:54,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:54,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:46:54,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339841840] [2021-12-28 08:46:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:54,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:46:54,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:54,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:46:54,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:54,378 INFO L87 Difference]: Start difference. First operand 201 states and 242 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-12-28 08:46:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:54,383 INFO L93 Difference]: Finished difference Result 238 states and 283 transitions. [2021-12-28 08:46:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:46:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 53 [2021-12-28 08:46:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:54,384 INFO L225 Difference]: With dead ends: 238 [2021-12-28 08:46:54,384 INFO L226 Difference]: Without dead ends: 177 [2021-12-28 08:46:54,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:46:54,385 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:54,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 174 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 08:46:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-28 08:46:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 156. [2021-12-28 08:46:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 155 states have internal predecessors, (190), 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-12-28 08:46:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2021-12-28 08:46:54,388 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 53 [2021-12-28 08:46:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:54,389 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2021-12-28 08:46:54,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-12-28 08:46:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2021-12-28 08:46:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 08:46:54,390 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:54,390 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:54,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 08:46:54,390 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash 255895067, now seen corresponding path program 1 times [2021-12-28 08:46:54,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:54,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461824974] [2021-12-28 08:46:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:54,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 08:46:54,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:54,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461824974] [2021-12-28 08:46:54,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461824974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:54,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:54,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 08:46:54,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268600135] [2021-12-28 08:46:54,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:54,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:46:54,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:46:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:46:54,421 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:54,454 INFO L93 Difference]: Finished difference Result 408 states and 498 transitions. [2021-12-28 08:46:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:46:54,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-28 08:46:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:54,455 INFO L225 Difference]: With dead ends: 408 [2021-12-28 08:46:54,456 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 08:46:54,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:46:54,456 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 55 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:54,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 08:46:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 08:46:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 197. [2021-12-28 08:46:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.260204081632653) internal successors, (247), 196 states have internal predecessors, (247), 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-12-28 08:46:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2021-12-28 08:46:54,461 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 62 [2021-12-28 08:46:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:54,461 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2021-12-28 08:46:54,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2021-12-28 08:46:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 08:46:54,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:54,462 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:54,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 08:46:54,463 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1988088231, now seen corresponding path program 2 times [2021-12-28 08:46:54,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:54,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018904761] [2021-12-28 08:46:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:54,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 08:46:54,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:54,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018904761] [2021-12-28 08:46:54,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018904761] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:46:54,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363129974] [2021-12-28 08:46:54,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 08:46:54,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:54,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:46:54,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 08:46:54,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 08:46:54,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 08:46:54,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 08:46:54,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:46:54,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:46:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 08:46:54,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:46:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 08:46:54,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363129974] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:46:54,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 08:46:54,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-28 08:46:54,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105679665] [2021-12-28 08:46:54,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 08:46:54,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 08:46:54,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:54,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 08:46:54,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:46:54,785 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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-12-28 08:46:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:55,130 INFO L93 Difference]: Finished difference Result 529 states and 707 transitions. [2021-12-28 08:46:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 08:46:55,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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 62 [2021-12-28 08:46:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:55,132 INFO L225 Difference]: With dead ends: 529 [2021-12-28 08:46:55,132 INFO L226 Difference]: Without dead ends: 332 [2021-12-28 08:46:55,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2021-12-28 08:46:55,133 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 306 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:55,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 192 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 08:46:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-28 08:46:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 230. [2021-12-28 08:46:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.2707423580786026) internal successors, (291), 229 states have internal predecessors, (291), 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-12-28 08:46:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 291 transitions. [2021-12-28 08:46:55,139 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 291 transitions. Word has length 62 [2021-12-28 08:46:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:55,139 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 291 transitions. [2021-12-28 08:46:55,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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-12-28 08:46:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2021-12-28 08:46:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-28 08:46:55,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:55,139 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:55,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 08:46:55,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:55,344 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 25170625, now seen corresponding path program 1 times [2021-12-28 08:46:55,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:55,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320080354] [2021-12-28 08:46:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:55,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-28 08:46:55,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:55,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320080354] [2021-12-28 08:46:55,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320080354] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:55,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:55,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 08:46:55,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447463987] [2021-12-28 08:46:55,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:55,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 08:46:55,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 08:46:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:46:55,414 INFO L87 Difference]: Start difference. First operand 230 states and 291 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-12-28 08:46:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:55,588 INFO L93 Difference]: Finished difference Result 875 states and 1113 transitions. [2021-12-28 08:46:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 08:46:55,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-12-28 08:46:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:55,590 INFO L225 Difference]: With dead ends: 875 [2021-12-28 08:46:55,590 INFO L226 Difference]: Without dead ends: 672 [2021-12-28 08:46:55,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 08:46:55,591 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 189 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:55,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 388 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:46:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-12-28 08:46:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 230. [2021-12-28 08:46:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.2707423580786026) internal successors, (291), 229 states have internal predecessors, (291), 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-12-28 08:46:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 291 transitions. [2021-12-28 08:46:55,608 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 291 transitions. Word has length 80 [2021-12-28 08:46:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:55,608 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 291 transitions. [2021-12-28 08:46:55,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-12-28 08:46:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2021-12-28 08:46:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 08:46:55,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:55,609 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:55,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 08:46:55,610 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -705708941, now seen corresponding path program 1 times [2021-12-28 08:46:55,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:55,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50613774] [2021-12-28 08:46:55,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:55,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-28 08:46:55,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50613774] [2021-12-28 08:46:55,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50613774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:55,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:55,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 08:46:55,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708403118] [2021-12-28 08:46:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:55,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 08:46:55,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 08:46:55,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:46:55,659 INFO L87 Difference]: Start difference. First operand 230 states and 291 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:55,714 INFO L93 Difference]: Finished difference Result 579 states and 705 transitions. [2021-12-28 08:46:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 08:46:55,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-28 08:46:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:55,715 INFO L225 Difference]: With dead ends: 579 [2021-12-28 08:46:55,716 INFO L226 Difference]: Without dead ends: 376 [2021-12-28 08:46:55,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-28 08:46:55,716 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 168 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:55,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 229 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 08:46:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-12-28 08:46:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 269. [2021-12-28 08:46:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.1940298507462686) internal successors, (320), 268 states have internal predecessors, (320), 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-12-28 08:46:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2021-12-28 08:46:55,724 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 83 [2021-12-28 08:46:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:55,724 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2021-12-28 08:46:55,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2021-12-28 08:46:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 08:46:55,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:55,725 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:55,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 08:46:55,725 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1924468269, now seen corresponding path program 1 times [2021-12-28 08:46:55,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:55,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700564663] [2021-12-28 08:46:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:55,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-28 08:46:55,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:55,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700564663] [2021-12-28 08:46:55,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700564663] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:55,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:55,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 08:46:55,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810893885] [2021-12-28 08:46:55,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:55,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 08:46:55,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 08:46:55,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 08:46:55,791 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-12-28 08:46:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:56,036 INFO L93 Difference]: Finished difference Result 1314 states and 1561 transitions. [2021-12-28 08:46:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 08:46:56,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-28 08:46:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:56,039 INFO L225 Difference]: With dead ends: 1314 [2021-12-28 08:46:56,039 INFO L226 Difference]: Without dead ends: 1072 [2021-12-28 08:46:56,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:46:56,040 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 283 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:56,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 517 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 08:46:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-12-28 08:46:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 269. [2021-12-28 08:46:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.1940298507462686) internal successors, (320), 268 states have internal predecessors, (320), 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-12-28 08:46:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2021-12-28 08:46:56,052 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 83 [2021-12-28 08:46:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:56,052 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2021-12-28 08:46:56,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-12-28 08:46:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2021-12-28 08:46:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 08:46:56,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:56,053 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:56,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 08:46:56,053 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 335021134, now seen corresponding path program 1 times [2021-12-28 08:46:56,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:56,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531250421] [2021-12-28 08:46:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:56,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-28 08:46:56,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:56,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531250421] [2021-12-28 08:46:56,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531250421] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:46:56,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940870971] [2021-12-28 08:46:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:56,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:56,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:46:56,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 08:46:56,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 08:46:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:56,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 08:46:56,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:46:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 08:46:56,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:46:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-28 08:46:56,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940870971] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:46:56,550 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 08:46:56,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-28 08:46:56,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872692775] [2021-12-28 08:46:56,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 08:46:56,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 08:46:56,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:56,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 08:46:56,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-28 08:46:56,551 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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-12-28 08:46:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:56,837 INFO L93 Difference]: Finished difference Result 1088 states and 1300 transitions. [2021-12-28 08:46:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 08:46:56,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-28 08:46:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:56,840 INFO L225 Difference]: With dead ends: 1088 [2021-12-28 08:46:56,840 INFO L226 Difference]: Without dead ends: 846 [2021-12-28 08:46:56,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-12-28 08:46:56,841 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 366 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:56,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 337 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 08:46:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-12-28 08:46:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 555. [2021-12-28 08:46:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.211191335740072) internal successors, (671), 554 states have internal predecessors, (671), 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-12-28 08:46:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 671 transitions. [2021-12-28 08:46:56,866 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 671 transitions. Word has length 83 [2021-12-28 08:46:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:56,866 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 671 transitions. [2021-12-28 08:46:56,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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-12-28 08:46:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 671 transitions. [2021-12-28 08:46:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-28 08:46:56,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:56,867 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:56,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 08:46:57,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-28 08:46:57,080 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1183041321, now seen corresponding path program 1 times [2021-12-28 08:46:57,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:57,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973414299] [2021-12-28 08:46:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:57,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-28 08:46:57,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:57,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973414299] [2021-12-28 08:46:57,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973414299] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:46:57,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:46:57,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 08:46:57,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231225220] [2021-12-28 08:46:57,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:46:57,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 08:46:57,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 08:46:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 08:46:57,154 INFO L87 Difference]: Start difference. First operand 555 states and 671 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:46:57,489 INFO L93 Difference]: Finished difference Result 1472 states and 1757 transitions. [2021-12-28 08:46:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 08:46:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-28 08:46:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:46:57,492 INFO L225 Difference]: With dead ends: 1472 [2021-12-28 08:46:57,492 INFO L226 Difference]: Without dead ends: 1229 [2021-12-28 08:46:57,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-28 08:46:57,493 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 375 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:46:57,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 779 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:46:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2021-12-28 08:46:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 551. [2021-12-28 08:46:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2127272727272727) internal successors, (667), 550 states have internal predecessors, (667), 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-12-28 08:46:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 667 transitions. [2021-12-28 08:46:57,515 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 667 transitions. Word has length 85 [2021-12-28 08:46:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:46:57,515 INFO L470 AbstractCegarLoop]: Abstraction has 551 states and 667 transitions. [2021-12-28 08:46:57,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:46:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 667 transitions. [2021-12-28 08:46:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-28 08:46:57,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:46:57,517 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:46:57,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 08:46:57,517 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:46:57,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:46:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1767062975, now seen corresponding path program 1 times [2021-12-28 08:46:57,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:46:57,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024688658] [2021-12-28 08:46:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:57,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:46:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-28 08:46:57,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:46:57,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024688658] [2021-12-28 08:46:57,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024688658] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:46:57,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439951854] [2021-12-28 08:46:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:46:57,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:46:57,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:46:57,620 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 08:46:57,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 08:46:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:46:57,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 08:46:57,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:46:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-28 08:46:57,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:46:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-28 08:46:58,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439951854] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:46:58,112 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 08:46:58,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2021-12-28 08:46:58,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413417587] [2021-12-28 08:46:58,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 08:46:58,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-28 08:46:58,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:46:58,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-28 08:46:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-28 08:46:58,113 INFO L87 Difference]: Start difference. First operand 551 states and 667 transitions. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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-12-28 08:47:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:47:00,751 INFO L93 Difference]: Finished difference Result 2024 states and 2379 transitions. [2021-12-28 08:47:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-12-28 08:47:00,752 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-12-28 08:47:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:47:00,756 INFO L225 Difference]: With dead ends: 2024 [2021-12-28 08:47:00,756 INFO L226 Difference]: Without dead ends: 1669 [2021-12-28 08:47:00,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2801 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1452, Invalid=7104, Unknown=0, NotChecked=0, Total=8556 [2021-12-28 08:47:00,758 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 1631 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 08:47:00,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1631 Valid, 1201 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 08:47:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2021-12-28 08:47:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 849. [2021-12-28 08:47:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 1.1992924528301887) internal successors, (1017), 848 states have internal predecessors, (1017), 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-12-28 08:47:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1017 transitions. [2021-12-28 08:47:00,785 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1017 transitions. Word has length 89 [2021-12-28 08:47:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:47:00,785 INFO L470 AbstractCegarLoop]: Abstraction has 849 states and 1017 transitions. [2021-12-28 08:47:00,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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-12-28 08:47:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1017 transitions. [2021-12-28 08:47:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-28 08:47:00,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:47:00,787 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:47:00,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 08:47:00,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-28 08:47:00,991 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:47:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:47:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash -646168391, now seen corresponding path program 1 times [2021-12-28 08:47:00,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:47:00,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913160376] [2021-12-28 08:47:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:47:00,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:47:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:47:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-28 08:47:01,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:47:01,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913160376] [2021-12-28 08:47:01,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913160376] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:47:01,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234989929] [2021-12-28 08:47:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:47:01,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:47:01,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:47:01,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 08:47:01,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 08:47:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:47:01,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 08:47:01,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:47:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-28 08:47:01,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:47:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-28 08:47:01,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234989929] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:47:01,909 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 08:47:01,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2021-12-28 08:47:01,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121342300] [2021-12-28 08:47:01,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 08:47:01,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-28 08:47:01,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:47:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 08:47:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-28 08:47:01,910 INFO L87 Difference]: Start difference. First operand 849 states and 1017 transitions. Second operand has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 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-12-28 08:47:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:47:03,047 INFO L93 Difference]: Finished difference Result 3894 states and 4568 transitions. [2021-12-28 08:47:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-28 08:47:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 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) Word has length 91 [2021-12-28 08:47:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:47:03,054 INFO L225 Difference]: With dead ends: 3894 [2021-12-28 08:47:03,054 INFO L226 Difference]: Without dead ends: 3428 [2021-12-28 08:47:03,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2021-12-28 08:47:03,056 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 977 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 08:47:03,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 1161 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 08:47:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2021-12-28 08:47:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 1032. [2021-12-28 08:47:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 1.2483026188166828) internal successors, (1287), 1031 states have internal predecessors, (1287), 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-12-28 08:47:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1287 transitions. [2021-12-28 08:47:03,103 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1287 transitions. Word has length 91 [2021-12-28 08:47:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:47:03,104 INFO L470 AbstractCegarLoop]: Abstraction has 1032 states and 1287 transitions. [2021-12-28 08:47:03,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 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-12-28 08:47:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1287 transitions. [2021-12-28 08:47:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-28 08:47:03,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:47:03,105 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:47:03,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-28 08:47:03,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:47:03,319 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:47:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:47:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -717591297, now seen corresponding path program 1 times [2021-12-28 08:47:03,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:47:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278913562] [2021-12-28 08:47:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:47:03,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:47:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:47:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 08:47:03,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 08:47:03,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278913562] [2021-12-28 08:47:03,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278913562] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 08:47:03,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282879308] [2021-12-28 08:47:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:47:03,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:47:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:47:03,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 08:47:03,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 08:47:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:47:03,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:47:03,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:47:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-28 08:47:03,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:47:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-28 08:47:18,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282879308] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:47:18,535 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 08:47:18,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2021-12-28 08:47:18,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854502597] [2021-12-28 08:47:18,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 08:47:18,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 08:47:18,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 08:47:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 08:47:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=57, Unknown=4, NotChecked=0, Total=90 [2021-12-28 08:47:18,537 INFO L87 Difference]: Start difference. First operand 1032 states and 1287 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-12-28 08:47:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:47:21,345 INFO L93 Difference]: Finished difference Result 2836 states and 3485 transitions. [2021-12-28 08:47:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 08:47:21,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-12-28 08:47:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:47:21,349 INFO L225 Difference]: With dead ends: 2836 [2021-12-28 08:47:21,349 INFO L226 Difference]: Without dead ends: 1672 [2021-12-28 08:47:21,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=83, Invalid=152, Unknown=5, NotChecked=0, Total=240 [2021-12-28 08:47:21,350 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 163 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:47:21,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 375 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 352 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2021-12-28 08:47:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2021-12-28 08:47:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1332. [2021-12-28 08:47:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1331 states have (on average 1.2464312546957175) internal successors, (1659), 1331 states have internal predecessors, (1659), 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-12-28 08:47:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1659 transitions. [2021-12-28 08:47:21,392 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1659 transitions. Word has length 97 [2021-12-28 08:47:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:47:21,392 INFO L470 AbstractCegarLoop]: Abstraction has 1332 states and 1659 transitions. [2021-12-28 08:47:21,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-12-28 08:47:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1659 transitions. [2021-12-28 08:47:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-28 08:47:21,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:47:21,393 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:47:21,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 08:47:21,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 08:47:21,610 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-28 08:47:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:47:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-12-28 08:47:21,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 08:47:21,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273930675] [2021-12-28 08:47:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:47:21,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 08:47:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 08:47:21,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 08:47:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 08:47:21,682 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 08:47:21,682 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 08:47:21,684 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-12-28 08:47:21,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-12-28 08:47:21,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-12-28 08:47:21,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-12-28 08:47:21,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-12-28 08:47:21,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-12-28 08:47:21,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-12-28 08:47:21,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-12-28 08:47:21,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-12-28 08:47:21,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-12-28 08:47:21,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-12-28 08:47:21,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-12-28 08:47:21,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-12-28 08:47:21,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-12-28 08:47:21,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-12-28 08:47:21,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-12-28 08:47:21,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-12-28 08:47:21,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 08:47:21,693 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:47:21,695 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 08:47:21,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 08:47:21 BoogieIcfgContainer [2021-12-28 08:47:21,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 08:47:21,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 08:47:21,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 08:47:21,783 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 08:47:21,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 08:46:51" (3/4) ... [2021-12-28 08:47:21,786 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-28 08:47:21,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 08:47:21,786 INFO L158 Benchmark]: Toolchain (without parser) took 30829.89ms. Allocated memory was 75.5MB in the beginning and 163.6MB in the end (delta: 88.1MB). Free memory was 57.4MB in the beginning and 49.3MB in the end (delta: 8.1MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2021-12-28 08:47:21,787 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 08:47:21,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.31ms. Allocated memory is still 75.5MB. Free memory was 57.3MB in the beginning and 56.6MB in the end (delta: 622.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 08:47:21,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.85ms. Allocated memory is still 75.5MB. Free memory was 56.6MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 08:47:21,787 INFO L158 Benchmark]: Boogie Preprocessor took 19.81ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 53.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 08:47:21,791 INFO L158 Benchmark]: RCFGBuilder took 307.39ms. Allocated memory is still 75.5MB. Free memory was 53.1MB in the beginning and 38.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-28 08:47:21,791 INFO L158 Benchmark]: TraceAbstraction took 30241.37ms. Allocated memory was 75.5MB in the beginning and 163.6MB in the end (delta: 88.1MB). Free memory was 38.2MB in the beginning and 49.3MB in the end (delta: -11.1MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2021-12-28 08:47:21,791 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 163.6MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 08:47:21,794 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.18ms. Allocated memory is still 75.5MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.31ms. Allocated memory is still 75.5MB. Free memory was 57.3MB in the beginning and 56.6MB in the end (delta: 622.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.85ms. Allocated memory is still 75.5MB. Free memory was 56.6MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.81ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 53.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 307.39ms. Allocated memory is still 75.5MB. Free memory was 53.1MB in the beginning and 38.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30241.37ms. Allocated memory was 75.5MB in the beginning and 163.6MB in the end (delta: 88.1MB). Free memory was 38.2MB in the beginning and 49.3MB in the end (delta: -11.1MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 163.6MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20839, r0=234770791] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20839, r0=234770791] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20839, r0=234770791] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20839, r0=234770791] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=20839, r0=234770791] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770791] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770791] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770791] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770791] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770791] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770791] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770791] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770791] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770791] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770791] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=234770791] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=234770791] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=234770791] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, r0=234770791] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, r0=234770791] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=20838, r0=234770791, r1=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=20838, r0=234770791, r1=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=20838, r0=234770791, r1=234770790] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=20838, r0=234770791, r1=234770790] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770791, r1=234770790] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770791, r1=234770790] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770791, r1=234770790] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770791, r1=234770790] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770791, r1=234770790] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770791, r1=234770790] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=234770791, r1=234770790] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=234770791, r1=234770790] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, r0=234770791, r1=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, r0=234770791, r1=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, r0=234770791, r1=234770790] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=20840, r0=234770791, r1=234770790, r2=234770792] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=20840, r0=234770791, r1=234770790, r2=234770792] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=3, na=4, nb=4, partial_sum=20840, r0=234770791, r1=234770790, r2=234770792] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790, r2=234770792] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790, r2=234770792] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790, r2=234770792] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790, r2=234770792] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790, r2=234770792] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770791, r1=234770790, r2=234770792] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770791, r1=234770790, r2=234770792] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770791, r1=234770790, r2=234770792] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770791, r1=234770790, r2=234770792] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770791, r1=234770790, r2=234770792] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770791, r1=234770790, r2=234770792] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770791, r1=234770790, r2=234770792] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792, r3=128] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792, r3=128] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770791, r1=234770790, r2=234770792, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 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: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5016 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5016 mSDsluCounter, 7119 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 117 IncrementalHoareTripleChecker+Unchecked, 5036 mSDsCounter, 665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5435 IncrementalHoareTripleChecker+Invalid, 6217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 665 mSolverCounterUnsat, 2083 mSDtfsCounter, 5435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1217 GetRequests, 978 SyntacticMatches, 9 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1332occurred in iteration=20, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 6320 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1743 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2031 ConstructedInterpolants, 5 QuantifiedInterpolants, 9547 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1261 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 33 InterpolantComputations, 15 PerfectInterpolantSequences, 1534/1731 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-12-28 08:47:21,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- 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