./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 3a877d22 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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 16:53:03,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 16:53:03,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 16:53:03,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 16:53:03,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 16:53:03,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 16:53:03,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 16:53:03,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 16:53:03,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 16:53:03,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 16:53:03,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 16:53:03,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 16:53:03,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 16:53:03,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 16:53:03,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 16:53:03,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 16:53:03,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 16:53:03,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 16:53:03,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 16:53:03,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 16:53:03,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 16:53:03,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 16:53:03,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 16:53:03,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 16:53:03,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 16:53:03,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 16:53:03,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 16:53:03,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 16:53:03,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 16:53:03,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 16:53:03,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 16:53:03,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 16:53:03,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 16:53:03,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 16:53:03,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 16:53:03,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 16:53:03,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 16:53:03,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 16:53:03,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 16:53:03,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 16:53:03,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 16:53:03,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-15 16:53:03,879 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 16:53:03,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 16:53:03,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 16:53:03,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 16:53:03,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 16:53:03,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 16:53:03,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 16:53:03,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 16:53:03,881 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 16:53:03,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 16:53:03,881 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 16:53:03,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 16:53:03,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 16:53:03,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 16:53:03,883 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 16:53:03,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 16:53:03,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 16:53:03,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 16:53:03,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 16:53:03,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 16:53:03,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 16:53:03,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 16:53:03,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 16:53:03,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 16:53:03,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 16:53:03,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 16:53:03,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 16:53:03,889 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-15 16:53:04,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 16:53:04,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 16:53:04,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 16:53:04,145 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 16:53:04,145 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 16:53:04,146 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-15 16:53:04,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dee54d8/f7e4d9b63f51456dab5556ea540d8619/FLAG5a4a07781 [2021-12-15 16:53:04,611 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 16:53:04,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-12-15 16:53:04,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dee54d8/f7e4d9b63f51456dab5556ea540d8619/FLAG5a4a07781 [2021-12-15 16:53:04,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dee54d8/f7e4d9b63f51456dab5556ea540d8619 [2021-12-15 16:53:04,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 16:53:04,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 16:53:04,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 16:53:04,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 16:53:04,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 16:53:04,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65491f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04, skipping insertion in model container [2021-12-15 16:53:04,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 16:53:04,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 16:53:04,818 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-15 16:53:04,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 16:53:04,861 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 16:53:04,879 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-15 16:53:04,898 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 16:53:04,909 INFO L208 MainTranslator]: Completed translation [2021-12-15 16:53:04,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04 WrapperNode [2021-12-15 16:53:04,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 16:53:04,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 16:53:04,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 16:53:04,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 16:53:04,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,954 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2021-12-15 16:53:04,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 16:53:04,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 16:53:04,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 16:53:04,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 16:53:04,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:04,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 16:53:05,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 16:53:05,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 16:53:05,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 16:53:05,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (1/1) ... [2021-12-15 16:53:05,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 16:53:05,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:05,033 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-15 16:53:05,039 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-15 16:53:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 16:53:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 16:53:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 16:53:05,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 16:53:05,109 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 16:53:05,110 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 16:53:05,374 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 16:53:05,381 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 16:53:05,383 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 16:53:05,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:53:05 BoogieIcfgContainer [2021-12-15 16:53:05,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 16:53:05,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 16:53:05,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 16:53:05,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 16:53:05,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 04:53:04" (1/3) ... [2021-12-15 16:53:05,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795f258b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 04:53:05, skipping insertion in model container [2021-12-15 16:53:05,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:53:04" (2/3) ... [2021-12-15 16:53:05,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795f258b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 04:53:05, skipping insertion in model container [2021-12-15 16:53:05,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:53:05" (3/3) ... [2021-12-15 16:53:05,393 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2021-12-15 16:53:05,397 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 16:53:05,397 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-12-15 16:53:05,439 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 16:53:05,443 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-15 16:53:05,444 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-12-15 16:53:05,455 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-15 16:53:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-15 16:53:05,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:05,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-15 16:53:05,461 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-15 16:53:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-12-15 16:53:05,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:05,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233814191] [2021-12-15 16:53:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:05,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:05,620 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-15 16:53:05,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:05,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233814191] [2021-12-15 16:53:05,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233814191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:05,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:05,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-15 16:53:05,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677128953] [2021-12-15 16:53:05,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:05,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 16:53:05,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:05,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 16:53:05,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 16:53:05,648 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-15 16:53:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:05,670 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-15 16:53:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 16:53:05,672 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-15 16:53:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:05,678 INFO L225 Difference]: With dead ends: 135 [2021-12-15 16:53:05,679 INFO L226 Difference]: Without dead ends: 69 [2021-12-15 16:53:05,681 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-15 16:53:05,683 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-15 16:53:05,684 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-15 16:53:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-15 16:53:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-15 16:53:05,715 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-15 16:53:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-12-15 16:53:05,720 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-12-15 16:53:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:05,720 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-12-15 16:53:05,721 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-15 16:53:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-12-15 16:53:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 16:53:05,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:05,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:53:05,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 16:53:05,722 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-15 16:53:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-12-15 16:53:05,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:05,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403299967] [2021-12-15 16:53:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:05,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:05,813 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-15 16:53:05,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:05,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403299967] [2021-12-15 16:53:05,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403299967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:05,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:05,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 16:53:05,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502293504] [2021-12-15 16:53:05,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:05,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 16:53:05,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:05,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 16:53:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 16:53:05,816 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-15 16:53:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:05,938 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-12-15 16:53:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 16:53:05,939 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-15 16:53:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:05,940 INFO L225 Difference]: With dead ends: 145 [2021-12-15 16:53:05,940 INFO L226 Difference]: Without dead ends: 98 [2021-12-15 16:53:05,941 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-15 16:53:05,942 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-15 16:53:05,942 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-15 16:53:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-15 16:53:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-15 16:53:05,949 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-15 16:53:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-12-15 16:53:05,950 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-12-15 16:53:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:05,951 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-12-15 16:53:05,951 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-15 16:53:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-12-15 16:53:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 16:53:05,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:05,952 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-15 16:53:05,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 16:53:05,952 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-15 16:53:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-12-15 16:53:05,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:05,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295682713] [2021-12-15 16:53:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:05,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:06,078 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-15 16:53:06,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:06,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295682713] [2021-12-15 16:53:06,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295682713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:06,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:06,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 16:53:06,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710466080] [2021-12-15 16:53:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:06,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 16:53:06,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 16:53:06,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 16:53:06,083 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-15 16:53:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:06,261 INFO L93 Difference]: Finished difference Result 238 states and 317 transitions. [2021-12-15 16:53:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:53:06,261 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-15 16:53:06,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:06,263 INFO L225 Difference]: With dead ends: 238 [2021-12-15 16:53:06,263 INFO L226 Difference]: Without dead ends: 174 [2021-12-15 16:53:06,264 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-15 16:53:06,265 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 127 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 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-15 16:53:06,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 291 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 16:53:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-15 16:53:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 107. [2021-12-15 16:53:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 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-15 16:53:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2021-12-15 16:53:06,276 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 20 [2021-12-15 16:53:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:06,276 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2021-12-15 16:53:06,276 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-15 16:53:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2021-12-15 16:53:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 16:53:06,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:06,277 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-15 16:53:06,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 16:53:06,278 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-15 16:53:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash 75768748, now seen corresponding path program 1 times [2021-12-15 16:53:06,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:06,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689006564] [2021-12-15 16:53:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:06,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:06,353 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-15 16:53:06,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689006564] [2021-12-15 16:53:06,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689006564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:06,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:06,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 16:53:06,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891342241] [2021-12-15 16:53:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:06,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 16:53:06,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 16:53:06,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 16:53:06,356 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:06,361 INFO L93 Difference]: Finished difference Result 172 states and 227 transitions. [2021-12-15 16:53:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 16:53:06,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 16:53:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:06,362 INFO L225 Difference]: With dead ends: 172 [2021-12-15 16:53:06,362 INFO L226 Difference]: Without dead ends: 81 [2021-12-15 16:53:06,363 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-15 16:53:06,365 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-15 16:53:06,366 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-15 16:53:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-15 16:53:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-15 16:53:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2021-12-15 16:53:06,383 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 23 [2021-12-15 16:53:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:06,383 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2021-12-15 16:53:06,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2021-12-15 16:53:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 16:53:06,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:06,385 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] [2021-12-15 16:53:06,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 16:53:06,385 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-15 16:53:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash 812672375, now seen corresponding path program 1 times [2021-12-15 16:53:06,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:06,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9837758] [2021-12-15 16:53:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:06,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:06,458 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-15 16:53:06,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9837758] [2021-12-15 16:53:06,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9837758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:06,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:06,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 16:53:06,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816639862] [2021-12-15 16:53:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:06,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 16:53:06,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:06,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 16:53:06,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 16:53:06,460 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:06,474 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2021-12-15 16:53:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 16:53:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 16:53:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:06,476 INFO L225 Difference]: With dead ends: 105 [2021-12-15 16:53:06,476 INFO L226 Difference]: Without dead ends: 92 [2021-12-15 16:53:06,476 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-15 16:53:06,477 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-15 16:53:06,477 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-15 16:53:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-15 16:53:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-15 16:53:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2021-12-15 16:53:06,486 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 29 [2021-12-15 16:53:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:06,487 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2021-12-15 16:53:06,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-12-15 16:53:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 16:53:06,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:06,488 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] [2021-12-15 16:53:06,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 16:53:06,488 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-15 16:53:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash -198444875, now seen corresponding path program 1 times [2021-12-15 16:53:06,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:06,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183635629] [2021-12-15 16:53:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:06,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:06,649 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-15 16:53:06,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:06,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183635629] [2021-12-15 16:53:06,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183635629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:06,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:06,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 16:53:06,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054390746] [2021-12-15 16:53:06,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:06,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 16:53:06,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 16:53:06,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 16:53:06,651 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:06,805 INFO L93 Difference]: Finished difference Result 238 states and 318 transitions. [2021-12-15 16:53:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:53:06,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 16:53:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:06,807 INFO L225 Difference]: With dead ends: 238 [2021-12-15 16:53:06,807 INFO L226 Difference]: Without dead ends: 175 [2021-12-15 16:53:06,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 16:53:06,810 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 106 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:06,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 250 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 16:53:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-15 16:53:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 102. [2021-12-15 16:53:06,826 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-15 16:53:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2021-12-15 16:53:06,827 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 29 [2021-12-15 16:53:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:06,827 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-12-15 16:53:06,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2021-12-15 16:53:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 16:53:06,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:06,828 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-15 16:53:06,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 16:53:06,828 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-15 16:53:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash 280536374, now seen corresponding path program 1 times [2021-12-15 16:53:06,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:06,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486328778] [2021-12-15 16:53:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:06,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:06,903 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-15 16:53:06,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486328778] [2021-12-15 16:53:06,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486328778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667667228] [2021-12-15 16:53:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:06,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:06,906 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-15 16:53:06,909 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-15 16:53:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:06,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 16:53:06,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:07,119 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-15 16:53:07,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 16:53:07,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667667228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:07,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 16:53:07,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-15 16:53:07,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086721280] [2021-12-15 16:53:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:07,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 16:53:07,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 16:53:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 16:53:07,121 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-15 16:53:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:07,280 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2021-12-15 16:53:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:53:07,280 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-15 16:53:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:07,281 INFO L225 Difference]: With dead ends: 218 [2021-12-15 16:53:07,281 INFO L226 Difference]: Without dead ends: 164 [2021-12-15 16:53:07,286 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-15 16:53:07,288 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-15 16:53:07,288 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-15 16:53:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-15 16:53:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2021-12-15 16:53:07,293 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-15 16:53:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-12-15 16:53:07,294 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 32 [2021-12-15 16:53:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:07,294 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-12-15 16:53:07,294 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-15 16:53:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-12-15 16:53:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 16:53:07,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:07,295 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-15 16:53:07,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 16:53:07,527 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-15 16:53:07,528 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-15 16:53:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1198830924, now seen corresponding path program 1 times [2021-12-15 16:53:07,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:07,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174939369] [2021-12-15 16:53:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:07,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:07,672 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-15 16:53:07,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:07,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174939369] [2021-12-15 16:53:07,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174939369] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:07,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219177896] [2021-12-15 16:53:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:07,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:07,675 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-15 16:53:07,678 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-15 16:53:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:07,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 16:53:07,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:07,807 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-15 16:53:07,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 16:53:07,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219177896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:07,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 16:53:07,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-15 16:53:07,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919636631] [2021-12-15 16:53:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:07,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 16:53:07,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:07,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 16:53:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 16:53:07,815 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-15 16:53:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:07,926 INFO L93 Difference]: Finished difference Result 315 states and 423 transitions. [2021-12-15 16:53:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:53:07,926 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-15 16:53:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:07,929 INFO L225 Difference]: With dead ends: 315 [2021-12-15 16:53:07,929 INFO L226 Difference]: Without dead ends: 205 [2021-12-15 16:53:07,930 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-15 16:53:07,931 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-15 16:53:07,931 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-15 16:53:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-15 16:53:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 169. [2021-12-15 16:53:07,941 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-15 16:53:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2021-12-15 16:53:07,944 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 39 [2021-12-15 16:53:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:07,944 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2021-12-15 16:53:07,944 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-15 16:53:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2021-12-15 16:53:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-15 16:53:07,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:07,951 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-15 16:53:07,982 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-15 16:53:08,182 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-15 16:53:08,183 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-15 16:53:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2073059654, now seen corresponding path program 1 times [2021-12-15 16:53:08,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:08,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719686450] [2021-12-15 16:53:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:08,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:08,321 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-15 16:53:08,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719686450] [2021-12-15 16:53:08,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719686450] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051735192] [2021-12-15 16:53:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:08,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:08,323 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-15 16:53:08,325 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-15 16:53:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:08,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 16:53:08,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:08,501 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-15 16:53:08,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 16:53:08,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051735192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:08,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 16:53:08,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-15 16:53:08,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074564320] [2021-12-15 16:53:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:08,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 16:53:08,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:08,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 16:53:08,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 16:53:08,504 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-15 16:53:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:08,644 INFO L93 Difference]: Finished difference Result 380 states and 494 transitions. [2021-12-15 16:53:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:53:08,645 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-15 16:53:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:08,647 INFO L225 Difference]: With dead ends: 380 [2021-12-15 16:53:08,647 INFO L226 Difference]: Without dead ends: 238 [2021-12-15 16:53:08,647 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-15 16:53:08,648 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-15 16:53:08,649 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-15 16:53:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-15 16:53:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 201. [2021-12-15 16:53:08,654 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-15 16:53:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 242 transitions. [2021-12-15 16:53:08,655 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 242 transitions. Word has length 46 [2021-12-15 16:53:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:08,655 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 242 transitions. [2021-12-15 16:53:08,655 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-15 16:53:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 242 transitions. [2021-12-15 16:53:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-15 16:53:08,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:08,656 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-15 16:53:08,678 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-15 16:53:08,871 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-15 16:53:08,873 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-15 16:53:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1645599792, now seen corresponding path program 1 times [2021-12-15 16:53:08,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:08,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523900139] [2021-12-15 16:53:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:08,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:08,934 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-15 16:53:08,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:08,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523900139] [2021-12-15 16:53:08,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523900139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:08,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:08,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 16:53:08,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733083295] [2021-12-15 16:53:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:08,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 16:53:08,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:08,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 16:53:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 16:53:08,935 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-15 16:53:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:08,940 INFO L93 Difference]: Finished difference Result 238 states and 283 transitions. [2021-12-15 16:53:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 16:53:08,941 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-15 16:53:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:08,942 INFO L225 Difference]: With dead ends: 238 [2021-12-15 16:53:08,942 INFO L226 Difference]: Without dead ends: 177 [2021-12-15 16:53:08,942 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-15 16:53:08,942 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-15 16:53:08,943 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-15 16:53:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-15 16:53:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 156. [2021-12-15 16:53:08,945 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-15 16:53:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2021-12-15 16:53:08,946 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 53 [2021-12-15 16:53:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:08,946 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2021-12-15 16:53:08,946 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-15 16:53:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2021-12-15 16:53:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-15 16:53:08,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:08,946 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-15 16:53:08,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 16:53:08,947 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-15 16:53:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:08,947 INFO L85 PathProgramCache]: Analyzing trace with hash 255895067, now seen corresponding path program 1 times [2021-12-15 16:53:08,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:08,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136158660] [2021-12-15 16:53:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:08,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:08,996 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-15 16:53:08,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:08,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136158660] [2021-12-15 16:53:08,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136158660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:08,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:08,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 16:53:08,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463484748] [2021-12-15 16:53:08,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:08,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 16:53:08,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:08,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 16:53:08,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 16:53:08,998 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-15 16:53:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:09,043 INFO L93 Difference]: Finished difference Result 408 states and 498 transitions. [2021-12-15 16:53:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:53:09,044 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-15 16:53:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:09,045 INFO L225 Difference]: With dead ends: 408 [2021-12-15 16:53:09,046 INFO L226 Difference]: Without dead ends: 279 [2021-12-15 16:53:09,046 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-15 16:53:09,047 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-15 16:53:09,048 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-15 16:53:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-15 16:53:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 197. [2021-12-15 16:53:09,054 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-15 16:53:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2021-12-15 16:53:09,054 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 62 [2021-12-15 16:53:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:09,055 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2021-12-15 16:53:09,059 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-15 16:53:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2021-12-15 16:53:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-15 16:53:09,060 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:09,060 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-15 16:53:09,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 16:53:09,060 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-15 16:53:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1988088231, now seen corresponding path program 2 times [2021-12-15 16:53:09,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:09,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286197414] [2021-12-15 16:53:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:09,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:09,161 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-15 16:53:09,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286197414] [2021-12-15 16:53:09,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286197414] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861636921] [2021-12-15 16:53:09,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 16:53:09,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:09,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:09,163 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-15 16:53:09,164 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-15 16:53:09,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 16:53:09,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 16:53:09,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 16:53:09,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-15 16:53:09,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 16:53:09,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861636921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:09,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 16:53:09,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-15 16:53:09,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177491707] [2021-12-15 16:53:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:09,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 16:53:09,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 16:53:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 16:53:09,366 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-15 16:53:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:09,489 INFO L93 Difference]: Finished difference Result 711 states and 902 transitions. [2021-12-15 16:53:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 16:53:09,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-15 16:53:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:09,492 INFO L225 Difference]: With dead ends: 711 [2021-12-15 16:53:09,492 INFO L226 Difference]: Without dead ends: 541 [2021-12-15 16:53:09,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 16:53:09,493 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 144 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:09,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 460 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 16:53:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-12-15 16:53:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 358. [2021-12-15 16:53:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.2717086834733893) internal successors, (454), 357 states have internal predecessors, (454), 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-15 16:53:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 454 transitions. [2021-12-15 16:53:09,506 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 454 transitions. Word has length 62 [2021-12-15 16:53:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:09,507 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 454 transitions. [2021-12-15 16:53:09,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-15 16:53:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 454 transitions. [2021-12-15 16:53:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-15 16:53:09,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:09,509 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, 1, 1, 1] [2021-12-15 16:53:09,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-15 16:53:09,719 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-15 16:53:09,719 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-15 16:53:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1745436811, now seen corresponding path program 1 times [2021-12-15 16:53:09,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661113489] [2021-12-15 16:53:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:09,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:09,760 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-15 16:53:09,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661113489] [2021-12-15 16:53:09,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661113489] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734432360] [2021-12-15 16:53:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:09,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:09,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:09,762 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-15 16:53:09,763 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-15 16:53:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:09,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 16:53:09,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:09,958 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-15 16:53:09,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 16:53:10,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734432360] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:10,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:10,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 7 [2021-12-15 16:53:10,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008289799] [2021-12-15 16:53:10,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:10,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 16:53:10,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 16:53:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 16:53:10,160 INFO L87 Difference]: Start difference. First operand 358 states and 454 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-15 16:53:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:10,307 INFO L93 Difference]: Finished difference Result 872 states and 1104 transitions. [2021-12-15 16:53:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 16:53:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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 65 [2021-12-15 16:53:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:10,308 INFO L225 Difference]: With dead ends: 872 [2021-12-15 16:53:10,308 INFO L226 Difference]: Without dead ends: 545 [2021-12-15 16:53:10,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 16:53:10,309 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 222 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:10,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 158 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 16:53:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-12-15 16:53:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 366. [2021-12-15 16:53:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.2657534246575342) internal successors, (462), 365 states have internal predecessors, (462), 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-15 16:53:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 462 transitions. [2021-12-15 16:53:10,318 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 462 transitions. Word has length 65 [2021-12-15 16:53:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:10,318 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 462 transitions. [2021-12-15 16:53:10,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-15 16:53:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 462 transitions. [2021-12-15 16:53:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-15 16:53:10,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:10,320 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:53:10,343 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-15 16:53:10,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-15 16:53:10,536 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-15 16:53:10,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash -392959527, now seen corresponding path program 1 times [2021-12-15 16:53:10,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:10,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514305401] [2021-12-15 16:53:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:10,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 16:53:10,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:10,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514305401] [2021-12-15 16:53:10,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514305401] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:10,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221020573] [2021-12-15 16:53:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:10,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:10,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:10,575 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-15 16:53:10,577 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-15 16:53:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:10,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 16:53:10,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 16:53:10,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 16:53:13,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221020573] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:13,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:13,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2021-12-15 16:53:13,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009596652] [2021-12-15 16:53:13,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:13,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 16:53:13,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:13,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 16:53:13,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-15 16:53:13,593 INFO L87 Difference]: Start difference. First operand 366 states and 462 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:13,889 INFO L93 Difference]: Finished difference Result 1418 states and 1815 transitions. [2021-12-15 16:53:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 16:53:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-15 16:53:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:13,892 INFO L225 Difference]: With dead ends: 1418 [2021-12-15 16:53:13,892 INFO L226 Difference]: Without dead ends: 1049 [2021-12-15 16:53:13,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-12-15 16:53:13,893 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 339 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:13,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 271 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 268 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2021-12-15 16:53:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-12-15 16:53:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 905. [2021-12-15 16:53:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 1.2577433628318584) internal successors, (1137), 904 states have internal predecessors, (1137), 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-15 16:53:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1137 transitions. [2021-12-15 16:53:13,912 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1137 transitions. Word has length 71 [2021-12-15 16:53:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:13,912 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1137 transitions. [2021-12-15 16:53:13,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:53:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1137 transitions. [2021-12-15 16:53:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-15 16:53:13,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:13,915 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:53:13,935 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-15 16:53:14,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:14,135 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-15 16:53:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1149725251, now seen corresponding path program 1 times [2021-12-15 16:53:14,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:14,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087204459] [2021-12-15 16:53:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:14,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 16:53:14,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087204459] [2021-12-15 16:53:14,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087204459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:14,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:14,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 16:53:14,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671156545] [2021-12-15 16:53:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:14,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 16:53:14,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 16:53:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 16:53:14,218 INFO L87 Difference]: Start difference. First operand 905 states and 1137 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-15 16:53:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:14,544 INFO L93 Difference]: Finished difference Result 2528 states and 3161 transitions. [2021-12-15 16:53:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 16:53:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 71 [2021-12-15 16:53:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:14,549 INFO L225 Difference]: With dead ends: 2528 [2021-12-15 16:53:14,549 INFO L226 Difference]: Without dead ends: 1435 [2021-12-15 16:53:14,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-15 16:53:14,553 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 139 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:14,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 246 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 16:53:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2021-12-15 16:53:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1012. [2021-12-15 16:53:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2700296735905046) internal successors, (1284), 1011 states have internal predecessors, (1284), 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-15 16:53:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1284 transitions. [2021-12-15 16:53:14,587 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1284 transitions. Word has length 71 [2021-12-15 16:53:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:14,588 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1284 transitions. [2021-12-15 16:53:14,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-15 16:53:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1284 transitions. [2021-12-15 16:53:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-15 16:53:14,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:14,592 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2021-12-15 16:53:14,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 16:53:14,593 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-15 16:53:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1488348929, now seen corresponding path program 1 times [2021-12-15 16:53:14,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:14,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181656844] [2021-12-15 16:53:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:14,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 16:53:14,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:14,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181656844] [2021-12-15 16:53:14,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181656844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:14,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:14,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 16:53:14,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154487671] [2021-12-15 16:53:14,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:14,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 16:53:14,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:14,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 16:53:14,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 16:53:14,687 INFO L87 Difference]: Start difference. First operand 1012 states and 1284 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-15 16:53:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:15,080 INFO L93 Difference]: Finished difference Result 2527 states and 3176 transitions. [2021-12-15 16:53:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 16:53:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 77 [2021-12-15 16:53:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:15,085 INFO L225 Difference]: With dead ends: 2527 [2021-12-15 16:53:15,085 INFO L226 Difference]: Without dead ends: 1412 [2021-12-15 16:53:15,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-12-15 16:53:15,088 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 216 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:15,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 277 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 16:53:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2021-12-15 16:53:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1082. [2021-12-15 16:53:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 1.274745605920444) internal successors, (1378), 1081 states have internal predecessors, (1378), 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-15 16:53:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1378 transitions. [2021-12-15 16:53:15,118 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1378 transitions. Word has length 77 [2021-12-15 16:53:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:15,118 INFO L470 AbstractCegarLoop]: Abstraction has 1082 states and 1378 transitions. [2021-12-15 16:53:15,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-15 16:53:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1378 transitions. [2021-12-15 16:53:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-15 16:53:15,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:15,121 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:53:15,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 16:53:15,121 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-15 16:53:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -529637703, now seen corresponding path program 1 times [2021-12-15 16:53:15,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056796057] [2021-12-15 16:53:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:15,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-15 16:53:15,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:15,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056796057] [2021-12-15 16:53:15,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056796057] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:15,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989205579] [2021-12-15 16:53:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:15,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:15,216 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-15 16:53:15,240 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-15 16:53:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:15,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 16:53:15,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 16:53:15,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-15 16:53:15,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989205579] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:15,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:15,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2021-12-15 16:53:15,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238632994] [2021-12-15 16:53:15,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:15,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 16:53:15,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:15,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 16:53:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-15 16:53:15,582 INFO L87 Difference]: Start difference. First operand 1082 states and 1378 transitions. Second operand has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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-15 16:53:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:16,838 INFO L93 Difference]: Finished difference Result 6182 states and 7507 transitions. [2021-12-15 16:53:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-15 16:53:16,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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 77 [2021-12-15 16:53:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:16,854 INFO L225 Difference]: With dead ends: 6182 [2021-12-15 16:53:16,855 INFO L226 Difference]: Without dead ends: 6109 [2021-12-15 16:53:16,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2021-12-15 16:53:16,858 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 734 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:16,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 737 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 16:53:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2021-12-15 16:53:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 1604. [2021-12-15 16:53:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.4036182158452901) internal successors, (2250), 1603 states have internal predecessors, (2250), 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-15 16:53:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2250 transitions. [2021-12-15 16:53:16,924 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2250 transitions. Word has length 77 [2021-12-15 16:53:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:16,924 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2250 transitions. [2021-12-15 16:53:16,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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-15 16:53:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2250 transitions. [2021-12-15 16:53:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-15 16:53:16,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:16,926 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-15 16:53:16,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 16:53:17,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:17,139 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-15 16:53:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash -705708941, now seen corresponding path program 1 times [2021-12-15 16:53:17,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:17,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744553422] [2021-12-15 16:53:17,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:17,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:17,228 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-15 16:53:17,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:17,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744553422] [2021-12-15 16:53:17,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744553422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:17,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:17,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 16:53:17,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839224459] [2021-12-15 16:53:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:17,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 16:53:17,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 16:53:17,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 16:53:17,231 INFO L87 Difference]: Start difference. First operand 1604 states and 2250 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-15 16:53:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:17,338 INFO L93 Difference]: Finished difference Result 4188 states and 5649 transitions. [2021-12-15 16:53:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 16:53:17,339 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-15 16:53:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:17,348 INFO L225 Difference]: With dead ends: 4188 [2021-12-15 16:53:17,348 INFO L226 Difference]: Without dead ends: 2615 [2021-12-15 16:53:17,351 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-15 16:53:17,352 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 193 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:17,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 275 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 16:53:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2021-12-15 16:53:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1936. [2021-12-15 16:53:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1935 states have (on average 1.3074935400516796) internal successors, (2530), 1935 states have internal predecessors, (2530), 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-15 16:53:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2530 transitions. [2021-12-15 16:53:17,410 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2530 transitions. Word has length 83 [2021-12-15 16:53:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:17,410 INFO L470 AbstractCegarLoop]: Abstraction has 1936 states and 2530 transitions. [2021-12-15 16:53:17,410 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-15 16:53:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2530 transitions. [2021-12-15 16:53:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-15 16:53:17,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:17,413 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-15 16:53:17,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 16:53:17,413 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-15 16:53:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1924468269, now seen corresponding path program 1 times [2021-12-15 16:53:17,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:17,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381977455] [2021-12-15 16:53:17,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:17,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:17,502 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-15 16:53:17,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:17,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381977455] [2021-12-15 16:53:17,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381977455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:17,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:17,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 16:53:17,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529721016] [2021-12-15 16:53:17,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:17,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 16:53:17,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 16:53:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 16:53:17,506 INFO L87 Difference]: Start difference. First operand 1936 states and 2530 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-15 16:53:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:17,920 INFO L93 Difference]: Finished difference Result 4832 states and 6232 transitions. [2021-12-15 16:53:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 16:53:17,921 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-15 16:53:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:17,935 INFO L225 Difference]: With dead ends: 4832 [2021-12-15 16:53:17,935 INFO L226 Difference]: Without dead ends: 4716 [2021-12-15 16:53:17,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 16:53:17,938 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 304 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:17,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 578 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 16:53:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2021-12-15 16:53:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 1936. [2021-12-15 16:53:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1935 states have (on average 1.3074935400516796) internal successors, (2530), 1935 states have internal predecessors, (2530), 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-15 16:53:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2530 transitions. [2021-12-15 16:53:18,002 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2530 transitions. Word has length 83 [2021-12-15 16:53:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:18,002 INFO L470 AbstractCegarLoop]: Abstraction has 1936 states and 2530 transitions. [2021-12-15 16:53:18,002 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-15 16:53:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2530 transitions. [2021-12-15 16:53:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-15 16:53:18,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:18,005 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-15 16:53:18,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 16:53:18,005 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-15 16:53:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1508814206, now seen corresponding path program 1 times [2021-12-15 16:53:18,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:18,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481698324] [2021-12-15 16:53:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:18,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-15 16:53:18,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:18,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481698324] [2021-12-15 16:53:18,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481698324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:18,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842670396] [2021-12-15 16:53:18,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:18,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:18,132 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-15 16:53:18,133 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-15 16:53:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:18,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 16:53:18,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-15 16:53:18,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-15 16:53:18,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842670396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:18,568 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:18,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-15 16:53:18,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115033046] [2021-12-15 16:53:18,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:18,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 16:53:18,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 16:53:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-15 16:53:18,569 INFO L87 Difference]: Start difference. First operand 1936 states and 2530 transitions. Second operand has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 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-15 16:53:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:18,748 INFO L93 Difference]: Finished difference Result 3395 states and 4533 transitions. [2021-12-15 16:53:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 16:53:18,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 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-15 16:53:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:18,752 INFO L225 Difference]: With dead ends: 3395 [2021-12-15 16:53:18,752 INFO L226 Difference]: Without dead ends: 1418 [2021-12-15 16:53:18,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2021-12-15 16:53:18,755 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 172 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:18,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 147 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 16:53:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2021-12-15 16:53:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1111. [2021-12-15 16:53:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.2504504504504506) internal successors, (1388), 1110 states have internal predecessors, (1388), 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-15 16:53:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1388 transitions. [2021-12-15 16:53:18,781 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1388 transitions. Word has length 83 [2021-12-15 16:53:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:18,781 INFO L470 AbstractCegarLoop]: Abstraction has 1111 states and 1388 transitions. [2021-12-15 16:53:18,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 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-15 16:53:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1388 transitions. [2021-12-15 16:53:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-15 16:53:18,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:18,782 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-15 16:53:18,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-15 16:53:19,000 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-15 16:53:19,001 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-15 16:53:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash 335021134, now seen corresponding path program 1 times [2021-12-15 16:53:19,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:19,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784650814] [2021-12-15 16:53:19,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:19,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:19,079 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-15 16:53:19,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:19,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784650814] [2021-12-15 16:53:19,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784650814] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:19,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371690074] [2021-12-15 16:53:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:19,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:19,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:19,096 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:53:19,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 16:53:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:19,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 16:53:19,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:19,356 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-15 16:53:19,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:19,593 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-15 16:53:19,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371690074] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:19,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:19,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-15 16:53:19,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406862384] [2021-12-15 16:53:19,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:19,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 16:53:19,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 16:53:19,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-15 16:53:19,595 INFO L87 Difference]: Start difference. First operand 1111 states and 1388 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-15 16:53:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:19,993 INFO L93 Difference]: Finished difference Result 2679 states and 3297 transitions. [2021-12-15 16:53:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 16:53:19,993 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-15 16:53:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:19,998 INFO L225 Difference]: With dead ends: 2679 [2021-12-15 16:53:19,998 INFO L226 Difference]: Without dead ends: 1902 [2021-12-15 16:53:20,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-12-15 16:53:20,000 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 346 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:20,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 375 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 16:53:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2021-12-15 16:53:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1052. [2021-12-15 16:53:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.235965746907707) internal successors, (1299), 1051 states have internal predecessors, (1299), 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-15 16:53:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1299 transitions. [2021-12-15 16:53:20,028 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1299 transitions. Word has length 83 [2021-12-15 16:53:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:20,028 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1299 transitions. [2021-12-15 16:53:20,028 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-15 16:53:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1299 transitions. [2021-12-15 16:53:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-15 16:53:20,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:20,029 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-15 16:53:20,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 16:53:20,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:20,243 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-15 16:53:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:20,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1183041321, now seen corresponding path program 1 times [2021-12-15 16:53:20,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:20,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125292926] [2021-12-15 16:53:20,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:20,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:20,351 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-15 16:53:20,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:20,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125292926] [2021-12-15 16:53:20,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125292926] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:53:20,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:53:20,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 16:53:20,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861943853] [2021-12-15 16:53:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:53:20,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 16:53:20,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 16:53:20,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 16:53:20,352 INFO L87 Difference]: Start difference. First operand 1052 states and 1299 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-15 16:53:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:20,838 INFO L93 Difference]: Finished difference Result 2466 states and 3022 transitions. [2021-12-15 16:53:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 16:53:20,839 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-15 16:53:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:20,846 INFO L225 Difference]: With dead ends: 2466 [2021-12-15 16:53:20,846 INFO L226 Difference]: Without dead ends: 2362 [2021-12-15 16:53:20,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-15 16:53:20,874 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 375 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:20,874 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.4s Time] [2021-12-15 16:53:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2021-12-15 16:53:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1042. [2021-12-15 16:53:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.2372718539865515) internal successors, (1288), 1041 states have internal predecessors, (1288), 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-15 16:53:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1288 transitions. [2021-12-15 16:53:20,910 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1288 transitions. Word has length 85 [2021-12-15 16:53:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:20,910 INFO L470 AbstractCegarLoop]: Abstraction has 1042 states and 1288 transitions. [2021-12-15 16:53:20,910 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-15 16:53:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1288 transitions. [2021-12-15 16:53:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-15 16:53:20,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:20,911 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-15 16:53:20,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-15 16:53:20,911 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-15 16:53:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1767062975, now seen corresponding path program 1 times [2021-12-15 16:53:20,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040250077] [2021-12-15 16:53:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:20,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:21,006 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-15 16:53:21,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:21,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040250077] [2021-12-15 16:53:21,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040250077] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:21,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105552651] [2021-12-15 16:53:21,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:21,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:21,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:53:21,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 16:53:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:21,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 16:53:21,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-15 16:53:21,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 16:53:21,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105552651] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:21,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:21,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2021-12-15 16:53:21,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268704178] [2021-12-15 16:53:21,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:21,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-15 16:53:21,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 16:53:21,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-15 16:53:21,549 INFO L87 Difference]: Start difference. First operand 1042 states and 1288 transitions. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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-15 16:53:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:24,721 INFO L93 Difference]: Finished difference Result 3056 states and 3641 transitions. [2021-12-15 16:53:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-12-15 16:53:24,721 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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-15 16:53:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:24,726 INFO L225 Difference]: With dead ends: 3056 [2021-12-15 16:53:24,726 INFO L226 Difference]: Without dead ends: 2261 [2021-12-15 16:53:24,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1362, Invalid=7010, Unknown=0, NotChecked=0, Total=8372 [2021-12-15 16:53:24,730 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 1477 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:24,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 1297 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-15 16:53:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2021-12-15 16:53:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1251. [2021-12-15 16:53:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 1.2472) internal successors, (1559), 1250 states have internal predecessors, (1559), 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-15 16:53:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1559 transitions. [2021-12-15 16:53:24,758 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1559 transitions. Word has length 89 [2021-12-15 16:53:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:24,758 INFO L470 AbstractCegarLoop]: Abstraction has 1251 states and 1559 transitions. [2021-12-15 16:53:24,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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-15 16:53:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1559 transitions. [2021-12-15 16:53:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-15 16:53:24,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:24,759 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:53:24,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 16:53:24,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-15 16:53:24,964 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-15 16:53:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1720526203, now seen corresponding path program 1 times [2021-12-15 16:53:24,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:24,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505818485] [2021-12-15 16:53:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:24,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:25,064 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-15 16:53:25,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505818485] [2021-12-15 16:53:25,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505818485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022875856] [2021-12-15 16:53:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:25,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:25,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:25,066 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:53:25,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 16:53:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:25,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 16:53:25,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:25,403 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-15 16:53:25,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:25,582 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-15 16:53:25,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022875856] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:25,583 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:25,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-15 16:53:25,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666557045] [2021-12-15 16:53:25,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:25,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 16:53:25,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 16:53:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-15 16:53:25,584 INFO L87 Difference]: Start difference. First operand 1251 states and 1559 transitions. Second operand has 14 states, 14 states have (on average 11.857142857142858) internal successors, (166), 14 states have internal predecessors, (166), 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-15 16:53:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:25,834 INFO L93 Difference]: Finished difference Result 1802 states and 2155 transitions. [2021-12-15 16:53:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 16:53:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.857142857142858) internal successors, (166), 14 states have internal predecessors, (166), 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-15 16:53:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:25,839 INFO L225 Difference]: With dead ends: 1802 [2021-12-15 16:53:25,839 INFO L226 Difference]: Without dead ends: 1715 [2021-12-15 16:53:25,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-12-15 16:53:25,841 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 317 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:25,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 703 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 16:53:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2021-12-15 16:53:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1236. [2021-12-15 16:53:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.2493927125506072) internal successors, (1543), 1235 states have internal predecessors, (1543), 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-15 16:53:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1543 transitions. [2021-12-15 16:53:25,869 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1543 transitions. Word has length 91 [2021-12-15 16:53:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:25,869 INFO L470 AbstractCegarLoop]: Abstraction has 1236 states and 1543 transitions. [2021-12-15 16:53:25,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.857142857142858) internal successors, (166), 14 states have internal predecessors, (166), 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-15 16:53:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1543 transitions. [2021-12-15 16:53:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-15 16:53:25,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:25,871 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-15 16:53:25,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 16:53:26,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-15 16:53:26,084 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-15 16:53:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash -646168391, now seen corresponding path program 2 times [2021-12-15 16:53:26,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:26,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59849572] [2021-12-15 16:53:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:26,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:53:26,181 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-15 16:53:26,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:53:26,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59849572] [2021-12-15 16:53:26,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59849572] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:53:26,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572605905] [2021-12-15 16:53:26,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 16:53:26,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:53:26,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:53:26,183 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:53:26,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 16:53:26,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 16:53:26,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 16:53:26,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-15 16:53:26,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:53:26,806 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-15 16:53:26,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:53:27,150 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-15 16:53:27,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572605905] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:53:27,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:53:27,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2021-12-15 16:53:27,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461197810] [2021-12-15 16:53:27,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:53:27,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 16:53:27,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:53:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 16:53:27,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-15 16:53:27,151 INFO L87 Difference]: Start difference. First operand 1236 states and 1543 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-15 16:53:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:53:28,264 INFO L93 Difference]: Finished difference Result 5088 states and 5971 transitions. [2021-12-15 16:53:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-15 16:53:28,265 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-15 16:53:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 16:53:28,271 INFO L225 Difference]: With dead ends: 5088 [2021-12-15 16:53:28,271 INFO L226 Difference]: Without dead ends: 4409 [2021-12-15 16:53:28,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2021-12-15 16:53:28,274 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 786 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 16:53:28,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 1324 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 16:53:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2021-12-15 16:53:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 944. [2021-12-15 16:53:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 1.2534464475079534) internal successors, (1182), 943 states have internal predecessors, (1182), 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-15 16:53:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1182 transitions. [2021-12-15 16:53:28,311 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1182 transitions. Word has length 91 [2021-12-15 16:53:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 16:53:28,311 INFO L470 AbstractCegarLoop]: Abstraction has 944 states and 1182 transitions. [2021-12-15 16:53:28,311 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-15 16:53:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1182 transitions. [2021-12-15 16:53:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-15 16:53:28,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 16:53:28,313 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-15 16:53:28,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 16:53:28,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-15 16:53:28,517 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-15 16:53:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:53:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-12-15 16:53:28,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:53:28,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369958073] [2021-12-15 16:53:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:53:28,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:53:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:53:28,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:53:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:53:28,604 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:53:28,604 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 16:53:28,605 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-12-15 16:53:28,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-12-15 16:53:28,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-12-15 16:53:28,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-12-15 16:53:28,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-12-15 16:53:28,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-12-15 16:53:28,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-12-15 16:53:28,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-12-15 16:53:28,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-12-15 16:53:28,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-12-15 16:53:28,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-12-15 16:53:28,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-12-15 16:53:28,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-12-15 16:53:28,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-12-15 16:53:28,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-12-15 16:53:28,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-12-15 16:53:28,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-12-15 16:53:28,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-12-15 16:53:28,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-12-15 16:53:28,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-12-15 16:53:28,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-12-15 16:53:28,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-12-15 16:53:28,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-12-15 16:53:28,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-12-15 16:53:28,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-15 16:53:28,614 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:53:28,617 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 16:53:28,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 04:53:28 BoogieIcfgContainer [2021-12-15 16:53:28,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 16:53:28,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 16:53:28,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 16:53:28,695 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 16:53:28,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:53:05" (3/4) ... [2021-12-15 16:53:28,697 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 16:53:28,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 16:53:28,698 INFO L158 Benchmark]: Toolchain (without parser) took 24059.11ms. Allocated memory was 86.0MB in the beginning and 251.7MB in the end (delta: 165.7MB). Free memory was 54.0MB in the beginning and 100.7MB in the end (delta: -46.7MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2021-12-15 16:53:28,698 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 86.0MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 16:53:28,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.69ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 53.8MB in the beginning and 94.5MB in the end (delta: -40.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 16:53:28,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.83ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 16:53:28,698 INFO L158 Benchmark]: Boogie Preprocessor took 46.57ms. Allocated memory is still 119.5MB. Free memory was 92.4MB in the beginning and 91.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 16:53:28,699 INFO L158 Benchmark]: RCFGBuilder took 383.66ms. Allocated memory is still 119.5MB. Free memory was 91.1MB in the beginning and 76.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 16:53:28,699 INFO L158 Benchmark]: TraceAbstraction took 23307.12ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 76.4MB in the beginning and 100.7MB in the end (delta: -24.3MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2021-12-15 16:53:28,699 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 251.7MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 16:53:28,700 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.23ms. Allocated memory is still 86.0MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.69ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 53.8MB in the beginning and 94.5MB in the end (delta: -40.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.83ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.57ms. Allocated memory is still 119.5MB. Free memory was 92.4MB in the beginning and 91.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.66ms. Allocated memory is still 119.5MB. Free memory was 91.1MB in the beginning and 76.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23307.12ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 76.4MB in the beginning and 100.7MB in the end (delta: -24.3MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 251.7MB. Free memory is still 100.7MB. 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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, 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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, 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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, 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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=0, na=4, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, 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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, 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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=0, na=4, nb=4, partial_sum=44800, r0=1912712960] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=0, na=4, nb=4, partial_sum=44800, r0=1912712960] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=0, na=4, nb=4, partial_sum=44800, r0=1912712960] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=0, na=4, nb=4, partial_sum=44800, r0=1912712960] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=1, na=4, nb=4, partial_sum=44800, r0=1912712960] [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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1912712960] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1912712960] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1912712960] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1912712960] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=1912712960] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=1912712960] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=1912712960] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=1912712960] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=1912712960] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=1912712960] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1912712960] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1912712960] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1912712960] [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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=1, na=4, nb=4, r0=1912712960] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=1, na=4, nb=4, r0=1912712960] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=1, na=4, nb=4, partial_sum=44801, r0=1912712960, r1=1912712961] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=1, na=4, nb=4, partial_sum=44801, r0=1912712960, r1=1912712961] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=1, na=4, nb=4, partial_sum=44801, r0=1912712960, r1=1912712961] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=2, na=4, nb=4, partial_sum=44801, r0=1912712960, r1=1912712961] [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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=1912712960, r1=1912712961] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=1912712960, r1=1912712961] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=1912712960, r1=1912712961] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=1912712960, r1=1912712961] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=1912712960, r1=1912712961] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=1912712960, r1=1912712961] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1912712960, r1=1912712961] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1912712960, r1=1912712961] [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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=2, na=4, nb=4, r0=1912712960, r1=1912712961] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=2, na=4, nb=4, r0=1912712960, r1=1912712961] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=2, na=4, nb=4, r0=1912712960, r1=1912712961] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=2, na=4, nb=4, partial_sum=44802, r0=1912712960, r1=1912712961, r2=1912712962] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=2, na=4, nb=4, partial_sum=44802, r0=1912712960, r1=1912712961, r2=1912712962] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=1, i=3, na=4, nb=4, partial_sum=44802, r0=1912712960, r1=1912712961, r2=1912712962] [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)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961, r2=1912712962] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961, r2=1912712962] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961, r2=1912712962] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961, r2=1912712962] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961, r2=1912712962] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1912712960, r1=1912712961, r2=1912712962] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=1912712960, r1=1912712961, r2=1912712962] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=1912712960, r1=1912712961, r2=1912712962] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=1912712960, r1=1912712961, r2=1912712962] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=1912712960, r1=1912712961, r2=1912712962] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=1912712960, r1=1912712961, r2=1912712962] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=1912712960, r1=1912712961, r2=1912712962] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962, r3=128] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962, r3=128] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1912712959, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712959, b0=1912712959, b1=7471534, b2=29185, b3=114, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1912712960, r1=1912712961, r2=1912712962, 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: 23.2s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6315 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6315 mSDsluCounter, 9536 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 46 IncrementalHoareTripleChecker+Unchecked, 6924 mSDsCounter, 745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7071 IncrementalHoareTripleChecker+Invalid, 7862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 745 mSolverCounterUnsat, 2612 mSDtfsCounter, 7071 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1822 GetRequests, 1496 SyntacticMatches, 21 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3759 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1936occurred in iteration=18, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 17001 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2391 NumberOfCodeBlocks, 2391 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2895 ConstructedInterpolants, 6 QuantifiedInterpolants, 12142 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1949 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 45 InterpolantComputations, 17 PerfectInterpolantSequences, 2287/2587 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-15 16:53:28,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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