/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 14:19:30,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:19:30,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:19:30,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:19:30,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:19:30,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:19:30,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:19:30,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:19:30,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:19:30,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:19:30,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:19:30,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:19:30,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:19:31,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:19:31,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:19:31,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:19:31,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:19:31,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:19:31,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:19:31,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:19:31,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:19:31,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:19:31,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:19:31,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:19:31,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:19:31,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:19:31,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:19:31,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:19:31,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:19:31,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:19:31,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:19:31,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:19:31,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:19:31,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:19:31,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:19:31,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:19:31,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:19:31,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:19:31,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:19:31,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:19:31,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:19:31,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 14:19:31,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:19:31,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:19:31,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:19:31,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:19:31,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:19:31,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:19:31,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:19:31,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:19:31,116 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:19:31,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:19:31,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:19:31,118 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:19:31,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:19:31,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:19:31,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:19:31,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:19:31,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:19:31,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:19:31,119 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:19:31,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:19:31,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:19:31,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:19:31,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:19:31,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:19:31,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:19:31,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:19:31,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:19:31,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:19:31,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:19:31,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:19:31,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:19:31,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:19:31,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:19:31,122 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 [2022-10-16 14:19:31,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:19:31,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:19:31,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:19:31,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:19:31,553 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:19:31,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2022-10-16 14:19:31,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a103971bc/244a6b8cdeca4ca9893ead87c6d56353/FLAG60ce08ac7 [2022-10-16 14:19:32,361 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:19:32,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2022-10-16 14:19:32,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a103971bc/244a6b8cdeca4ca9893ead87c6d56353/FLAG60ce08ac7 [2022-10-16 14:19:32,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a103971bc/244a6b8cdeca4ca9893ead87c6d56353 [2022-10-16 14:19:32,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:19:32,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:19:32,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:19:32,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:19:32,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:19:32,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:19:32" (1/1) ... [2022-10-16 14:19:32,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339c3592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:32, skipping insertion in model container [2022-10-16 14:19:32,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:19:32" (1/1) ... [2022-10-16 14:19:32,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:19:32,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:19:33,308 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/list-simple/dll2n_insert_equal.i[24706,24719] [2022-10-16 14:19:33,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:19:33,326 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:19:33,422 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/list-simple/dll2n_insert_equal.i[24706,24719] [2022-10-16 14:19:33,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:19:33,472 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:19:33,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33 WrapperNode [2022-10-16 14:19:33,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:19:33,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:19:33,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:19:33,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:19:33,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,586 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2022-10-16 14:19:33,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:19:33,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:19:33,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:19:33,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:19:33,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:19:33,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:19:33,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:19:33,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:19:33,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (1/1) ... [2022-10-16 14:19:33,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:19:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:33,721 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) [2022-10-16 14:19:33,743 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 [2022-10-16 14:19:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-16 14:19:33,798 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-16 14:19:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 14:19:33,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 14:19:33,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 14:19:33,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:19:33,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 14:19:33,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 14:19:33,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 14:19:33,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 14:19:33,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 14:19:33,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:19:33,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:19:33,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:19:33,940 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:19:33,943 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:19:34,036 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-16 14:19:34,420 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:19:34,429 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:19:34,429 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-16 14:19:34,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:19:34 BoogieIcfgContainer [2022-10-16 14:19:34,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:19:34,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:19:34,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:19:34,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:19:34,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:19:32" (1/3) ... [2022-10-16 14:19:34,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf471af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:19:34, skipping insertion in model container [2022-10-16 14:19:34,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:19:33" (2/3) ... [2022-10-16 14:19:34,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf471af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:19:34, skipping insertion in model container [2022-10-16 14:19:34,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:19:34" (3/3) ... [2022-10-16 14:19:34,442 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2022-10-16 14:19:34,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:19:34,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-10-16 14:19:34,538 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:19:34,559 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c6df6f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:19:34,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-10-16 14:19:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 49 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 14:19:34,575 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:34,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 14:19:34,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1038255142, now seen corresponding path program 1 times [2022-10-16 14:19:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:34,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680564784] [2022-10-16 14:19:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:34,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:34,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680564784] [2022-10-16 14:19:34,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680564784] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:34,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:34,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 14:19:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356999332] [2022-10-16 14:19:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:34,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 14:19:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:34,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 14:19:34,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 14:19:34,839 INFO L87 Difference]: Start difference. First operand has 51 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 49 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:34,865 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-10-16 14:19:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 14:19:34,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-10-16 14:19:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:34,877 INFO L225 Difference]: With dead ends: 90 [2022-10-16 14:19:34,878 INFO L226 Difference]: Without dead ends: 40 [2022-10-16 14:19:34,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 14:19:34,887 INFO L413 NwaCegarLoop]: 61 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, 61 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 [2022-10-16 14:19:34,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-16 14:19:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-16 14:19:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-10-16 14:19:34,935 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 6 [2022-10-16 14:19:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:34,935 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-10-16 14:19:34,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-10-16 14:19:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 14:19:34,937 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:34,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 14:19:34,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:19:34,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1037569949, now seen corresponding path program 1 times [2022-10-16 14:19:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:34,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963724437] [2022-10-16 14:19:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:34,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:35,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963724437] [2022-10-16 14:19:35,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963724437] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:35,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:35,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:19:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235973742] [2022-10-16 14:19:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:35,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:19:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:35,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:19:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:19:35,099 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:35,147 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-10-16 14:19:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:19:35,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-10-16 14:19:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:35,150 INFO L225 Difference]: With dead ends: 78 [2022-10-16 14:19:35,150 INFO L226 Difference]: Without dead ends: 49 [2022-10-16 14:19:35,150 INFO L412 NwaCegarLoop]: 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 [2022-10-16 14:19:35,152 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 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 [2022-10-16 14:19:35,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-16 14:19:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-10-16 14:19:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-10-16 14:19:35,161 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 6 [2022-10-16 14:19:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:35,162 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-10-16 14:19:35,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-10-16 14:19:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 14:19:35,163 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:35,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:35,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:19:35,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash 713346893, now seen corresponding path program 1 times [2022-10-16 14:19:35,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:35,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94758156] [2022-10-16 14:19:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:35,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:35,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94758156] [2022-10-16 14:19:35,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94758156] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:35,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:35,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:19:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937067961] [2022-10-16 14:19:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:35,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:19:35,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:35,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:19:35,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:19:35,276 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:35,322 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2022-10-16 14:19:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:19:35,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-16 14:19:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:35,326 INFO L225 Difference]: With dead ends: 83 [2022-10-16 14:19:35,327 INFO L226 Difference]: Without dead ends: 45 [2022-10-16 14:19:35,327 INFO L412 NwaCegarLoop]: 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 [2022-10-16 14:19:35,333 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:35,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-16 14:19:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-10-16 14:19:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 43 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) [2022-10-16 14:19:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-10-16 14:19:35,356 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 8 [2022-10-16 14:19:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:35,357 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-10-16 14:19:35,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-10-16 14:19:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 14:19:35,358 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:35,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:35,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 14:19:35,359 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:35,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 713348815, now seen corresponding path program 1 times [2022-10-16 14:19:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:35,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777809540] [2022-10-16 14:19:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:35,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:35,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777809540] [2022-10-16 14:19:35,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777809540] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:35,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:35,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:19:35,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153377242] [2022-10-16 14:19:35,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:35,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:19:35,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:19:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:19:35,567 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:35,606 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-10-16 14:19:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:19:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-16 14:19:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:35,608 INFO L225 Difference]: With dead ends: 49 [2022-10-16 14:19:35,608 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 14:19:35,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:19:35,611 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:35,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 14:19:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-10-16 14:19:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-10-16 14:19:35,619 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 8 [2022-10-16 14:19:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:35,620 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-10-16 14:19:35,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-10-16 14:19:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 14:19:35,621 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:35,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:35,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 14:19:35,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash 638976850, now seen corresponding path program 1 times [2022-10-16 14:19:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:35,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005004388] [2022-10-16 14:19:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:35,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005004388] [2022-10-16 14:19:35,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005004388] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:35,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:35,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:19:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061583505] [2022-10-16 14:19:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:35,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:19:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:19:35,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:19:35,755 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:35,803 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-10-16 14:19:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:19:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-10-16 14:19:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:35,806 INFO L225 Difference]: With dead ends: 48 [2022-10-16 14:19:35,806 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 14:19:35,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:19:35,809 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:35,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 14:19:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-16 14:19:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-10-16 14:19:35,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 9 [2022-10-16 14:19:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:35,828 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-10-16 14:19:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-10-16 14:19:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 14:19:35,831 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:35,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:35,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 14:19:35,831 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1509234317, now seen corresponding path program 1 times [2022-10-16 14:19:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:35,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409185514] [2022-10-16 14:19:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:35,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:35,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409185514] [2022-10-16 14:19:35,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409185514] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319220150] [2022-10-16 14:19:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:36,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:36,008 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) [2022-10-16 14:19:36,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 14:19:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:36,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 14:19:36,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:36,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:19:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:36,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319220150] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:19:36,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:19:36,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-10-16 14:19:36,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719092261] [2022-10-16 14:19:36,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:19:36,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:19:36,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:36,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:19:36,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:19:36,242 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:36,288 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-10-16 14:19:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:19:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 [2022-10-16 14:19:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:36,290 INFO L225 Difference]: With dead ends: 77 [2022-10-16 14:19:36,290 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 14:19:36,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:19:36,292 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:36,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 156 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 14:19:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 14:19:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-10-16 14:19:36,300 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 13 [2022-10-16 14:19:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:36,300 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-10-16 14:19:36,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-10-16 14:19:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 14:19:36,301 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:36,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:36,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:36,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 14:19:36,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:36,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1283728835, now seen corresponding path program 1 times [2022-10-16 14:19:36,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:36,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564447470] [2022-10-16 14:19:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:36,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:36,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564447470] [2022-10-16 14:19:36,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564447470] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:36,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602897247] [2022-10-16 14:19:36,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:36,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:36,668 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) [2022-10-16 14:19:36,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 14:19:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:36,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 14:19:36,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:19:36,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:19:36,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602897247] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:36,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:19:36,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-10-16 14:19:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57998253] [2022-10-16 14:19:36,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:36,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:19:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:36,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:19:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:19:36,829 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:36,882 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-10-16 14:19:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:19:36,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 14:19:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:36,884 INFO L225 Difference]: With dead ends: 48 [2022-10-16 14:19:36,884 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 14:19:36,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:19:36,887 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:36,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 14:19:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-16 14:19:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-10-16 14:19:36,903 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 15 [2022-10-16 14:19:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:36,903 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-10-16 14:19:36,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-10-16 14:19:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 14:19:36,905 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:36,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:36,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:37,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-16 14:19:37,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1140888156, now seen corresponding path program 1 times [2022-10-16 14:19:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:37,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954562932] [2022-10-16 14:19:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 14:19:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:37,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954562932] [2022-10-16 14:19:37,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954562932] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:37,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:37,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:19:37,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079903928] [2022-10-16 14:19:37,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:37,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:19:37,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:19:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:19:37,248 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:37,271 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-10-16 14:19:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:19:37,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-10-16 14:19:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:37,272 INFO L225 Difference]: With dead ends: 47 [2022-10-16 14:19:37,272 INFO L226 Difference]: Without dead ends: 46 [2022-10-16 14:19:37,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:19:37,274 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:37,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-16 14:19:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-16 14:19:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.368421052631579) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-10-16 14:19:37,280 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 16 [2022-10-16 14:19:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:37,280 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-10-16 14:19:37,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-10-16 14:19:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 14:19:37,281 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:37,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:37,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 14:19:37,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1382217761, now seen corresponding path program 1 times [2022-10-16 14:19:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:37,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46050567] [2022-10-16 14:19:37,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 14:19:37,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:37,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46050567] [2022-10-16 14:19:37,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46050567] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:37,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346953141] [2022-10-16 14:19:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:37,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:37,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:37,417 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) [2022-10-16 14:19:37,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 14:19:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:37,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:19:37,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:37,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:19:37,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346953141] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:37,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:19:37,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-10-16 14:19:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550236043] [2022-10-16 14:19:37,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:37,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:19:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:19:37,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:19:37,585 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:37,597 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-10-16 14:19:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:19:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 [2022-10-16 14:19:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:37,599 INFO L225 Difference]: With dead ends: 46 [2022-10-16 14:19:37,599 INFO L226 Difference]: Without dead ends: 40 [2022-10-16 14:19:37,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:19:37,600 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:37,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 38 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-16 14:19:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-16 14:19:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-10-16 14:19:37,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 20 [2022-10-16 14:19:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:37,623 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-10-16 14:19:37,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-10-16 14:19:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 14:19:37,627 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:37,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:37,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:37,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:37,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash 681660585, now seen corresponding path program 1 times [2022-10-16 14:19:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:37,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914589567] [2022-10-16 14:19:37,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 14:19:38,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:38,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914589567] [2022-10-16 14:19:38,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914589567] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:38,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19216044] [2022-10-16 14:19:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:38,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:38,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:38,084 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) [2022-10-16 14:19:38,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 14:19:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:38,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 14:19:38,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:38,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:19:38,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19216044] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:38,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:19:38,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-10-16 14:19:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325854962] [2022-10-16 14:19:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:38,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:19:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:19:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-16 14:19:38,286 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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) [2022-10-16 14:19:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:38,316 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-10-16 14:19:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:19:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 26 [2022-10-16 14:19:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:38,318 INFO L225 Difference]: With dead ends: 40 [2022-10-16 14:19:38,318 INFO L226 Difference]: Without dead ends: 39 [2022-10-16 14:19:38,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-10-16 14:19:38,319 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:38,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 74 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-16 14:19:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-16 14:19:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-10-16 14:19:38,325 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2022-10-16 14:19:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:38,325 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-10-16 14:19:38,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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) [2022-10-16 14:19:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-10-16 14:19:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 14:19:38,326 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:38,327 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:38,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:38,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:38,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash -343358247, now seen corresponding path program 1 times [2022-10-16 14:19:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:38,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883994261] [2022-10-16 14:19:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:38,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883994261] [2022-10-16 14:19:38,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883994261] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:38,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:38,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 14:19:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380566421] [2022-10-16 14:19:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:38,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:19:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:19:38,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:19:38,637 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:38,645 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-10-16 14:19:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:19:38,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-10-16 14:19:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:38,646 INFO L225 Difference]: With dead ends: 39 [2022-10-16 14:19:38,646 INFO L226 Difference]: Without dead ends: 38 [2022-10-16 14:19:38,647 INFO L412 NwaCegarLoop]: 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 [2022-10-16 14:19:38,648 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:38,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-16 14:19:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-16 14:19:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 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) [2022-10-16 14:19:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-10-16 14:19:38,653 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 27 [2022-10-16 14:19:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:38,653 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-10-16 14:19:38,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-10-16 14:19:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 14:19:38,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:38,655 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 14:19:38,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 14:19:38,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1644874787, now seen corresponding path program 1 times [2022-10-16 14:19:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:38,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576176853] [2022-10-16 14:19:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:38,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576176853] [2022-10-16 14:19:38,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576176853] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:38,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:38,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:19:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270765744] [2022-10-16 14:19:38,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:38,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:19:38,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:19:38,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:19:38,749 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:38,764 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-10-16 14:19:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:19:38,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-16 14:19:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:38,765 INFO L225 Difference]: With dead ends: 55 [2022-10-16 14:19:38,766 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 14:19:38,766 INFO L412 NwaCegarLoop]: 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 [2022-10-16 14:19:38,767 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:38,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 14:19:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-10-16 14:19:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-10-16 14:19:38,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2022-10-16 14:19:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:38,773 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-10-16 14:19:38,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-10-16 14:19:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 14:19:38,774 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:38,774 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 14:19:38,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 14:19:38,775 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:38,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1811480982, now seen corresponding path program 1 times [2022-10-16 14:19:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:38,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840869449] [2022-10-16 14:19:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:38,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840869449] [2022-10-16 14:19:38,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840869449] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:38,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:19:38,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:19:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866674693] [2022-10-16 14:19:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:38,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:19:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:38,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:19:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:19:38,912 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:38,933 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-10-16 14:19:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:19:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 14:19:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:38,935 INFO L225 Difference]: With dead ends: 46 [2022-10-16 14:19:38,935 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 14:19:38,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:19:38,936 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:38,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 14:19:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-16 14:19:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-10-16 14:19:38,942 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 32 [2022-10-16 14:19:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:38,943 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-10-16 14:19:38,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-10-16 14:19:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 14:19:38,944 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:38,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:38,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 14:19:38,945 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash 577692131, now seen corresponding path program 1 times [2022-10-16 14:19:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:38,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159979982] [2022-10-16 14:19:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:39,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159979982] [2022-10-16 14:19:39,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159979982] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:39,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740275231] [2022-10-16 14:19:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:39,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:39,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:39,106 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) [2022-10-16 14:19:39,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 14:19:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:39,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 14:19:39,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:39,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:19:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:39,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740275231] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:19:39,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:19:39,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 14:19:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535531799] [2022-10-16 14:19:39,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:19:39,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 14:19:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 14:19:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 14:19:39,348 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:39,441 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-10-16 14:19:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 14:19:39,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 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 36 [2022-10-16 14:19:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:39,442 INFO L225 Difference]: With dead ends: 60 [2022-10-16 14:19:39,442 INFO L226 Difference]: Without dead ends: 59 [2022-10-16 14:19:39,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 14:19:39,444 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:39,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 185 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-16 14:19:39,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-10-16 14:19:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-10-16 14:19:39,450 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 36 [2022-10-16 14:19:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:39,451 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-10-16 14:19:39,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-10-16 14:19:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 14:19:39,452 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:39,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:39,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:39,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 14:19:39,667 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 728587016, now seen corresponding path program 1 times [2022-10-16 14:19:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:39,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557040528] [2022-10-16 14:19:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 14:19:39,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:39,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557040528] [2022-10-16 14:19:39,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557040528] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:39,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665020618] [2022-10-16 14:19:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:39,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:39,935 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) [2022-10-16 14:19:39,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 14:19:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:40,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 14:19:40,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 14:19:40,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:19:40,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665020618] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:40,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:19:40,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-10-16 14:19:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273686807] [2022-10-16 14:19:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:40,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:19:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:19:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:19:40,124 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:40,149 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-10-16 14:19:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:19:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 37 [2022-10-16 14:19:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:40,153 INFO L225 Difference]: With dead ends: 55 [2022-10-16 14:19:40,153 INFO L226 Difference]: Without dead ends: 54 [2022-10-16 14:19:40,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:19:40,156 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:40,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-16 14:19:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-16 14:19:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-10-16 14:19:40,166 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 37 [2022-10-16 14:19:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:40,166 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-10-16 14:19:40,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-10-16 14:19:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 14:19:40,168 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:40,168 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:19:40,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:40,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 14:19:40,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:40,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1147326130, now seen corresponding path program 2 times [2022-10-16 14:19:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:40,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780316423] [2022-10-16 14:19:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-16 14:19:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:40,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780316423] [2022-10-16 14:19:40,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780316423] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:40,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569252837] [2022-10-16 14:19:40,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:19:40,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:40,689 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) [2022-10-16 14:19:40,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 14:19:40,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 14:19:40,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:19:40,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 14:19:40,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 14:19:40,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:19:40,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569252837] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:19:40,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:19:40,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-10-16 14:19:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028480245] [2022-10-16 14:19:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:19:40,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:19:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:19:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:19:40,930 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:40,950 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-10-16 14:19:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:19:40,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-10-16 14:19:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:40,951 INFO L225 Difference]: With dead ends: 77 [2022-10-16 14:19:40,951 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 14:19:40,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:19:40,953 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:40,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:19:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 14:19:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-16 14:19:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-10-16 14:19:40,961 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 48 [2022-10-16 14:19:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:40,961 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-10-16 14:19:40,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-10-16 14:19:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-16 14:19:40,963 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:40,963 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2022-10-16 14:19:41,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:41,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:41,177 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1055350123, now seen corresponding path program 1 times [2022-10-16 14:19:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:41,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858395880] [2022-10-16 14:19:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:19:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:41,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858395880] [2022-10-16 14:19:41,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858395880] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:41,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677674836] [2022-10-16 14:19:41,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:41,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:41,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:41,568 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) [2022-10-16 14:19:41,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 14:19:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:41,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 14:19:41,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:19:41,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:19:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:19:41,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677674836] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:19:41,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:19:41,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-10-16 14:19:41,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107864606] [2022-10-16 14:19:41,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:19:41,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 14:19:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 14:19:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-10-16 14:19:41,951 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:42,143 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-10-16 14:19:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 14:19:42,144 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-10-16 14:19:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:42,145 INFO L225 Difference]: With dead ends: 79 [2022-10-16 14:19:42,145 INFO L226 Difference]: Without dead ends: 78 [2022-10-16 14:19:42,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 14:19:42,147 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:42,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 310 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:19:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-16 14:19:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-10-16 14:19:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 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) [2022-10-16 14:19:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-10-16 14:19:42,156 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 50 [2022-10-16 14:19:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:42,156 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-10-16 14:19:42,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-10-16 14:19:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 14:19:42,158 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:42,158 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 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] [2022-10-16 14:19:42,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:42,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 14:19:42,374 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1232076053, now seen corresponding path program 2 times [2022-10-16 14:19:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:42,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17932204] [2022-10-16 14:19:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:19:43,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:43,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17932204] [2022-10-16 14:19:43,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17932204] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:43,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880282043] [2022-10-16 14:19:43,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:19:43,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:43,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:43,101 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) [2022-10-16 14:19:43,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 14:19:43,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:19:43,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:19:43,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 14:19:43,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:19:43,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:19:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:19:44,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880282043] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:19:44,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:19:44,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2022-10-16 14:19:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991993558] [2022-10-16 14:19:44,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:19:44,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-16 14:19:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:19:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-16 14:19:44,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2022-10-16 14:19:44,164 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 48 states, 47 states have (on average 2.4893617021276597) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:19:44,692 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2022-10-16 14:19:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-10-16 14:19:44,693 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.4893617021276597) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 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 74 [2022-10-16 14:19:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:19:44,694 INFO L225 Difference]: With dead ends: 127 [2022-10-16 14:19:44,694 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 14:19:44,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1382, Invalid=3448, Unknown=0, NotChecked=0, Total=4830 [2022-10-16 14:19:44,698 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 137 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:19:44,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 320 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:19:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 14:19:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-10-16 14:19:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.0564516129032258) internal successors, (131), 124 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) [2022-10-16 14:19:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2022-10-16 14:19:44,711 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 74 [2022-10-16 14:19:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:19:44,711 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2022-10-16 14:19:44,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.4893617021276597) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:19:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2022-10-16 14:19:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-10-16 14:19:44,713 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:19:44,713 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 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] [2022-10-16 14:19:44,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 14:19:44,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 14:19:44,928 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:19:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:19:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash -107848297, now seen corresponding path program 3 times [2022-10-16 14:19:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:19:44,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320877197] [2022-10-16 14:19:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:19:44,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:19:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:19:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:19:47,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:19:47,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320877197] [2022-10-16 14:19:47,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320877197] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:19:47,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174268536] [2022-10-16 14:19:47,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 14:19:47,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:19:47,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:19:47,133 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) [2022-10-16 14:19:47,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 14:19:50,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-10-16 14:19:50,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:19:50,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 144 conjunts are in the unsatisfiable core [2022-10-16 14:19:50,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:19:50,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-16 14:19:51,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 14:19:51,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 14:19:51,319 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 14:19:51,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-16 14:19:51,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2022-10-16 14:19:51,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 14:19:51,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2022-10-16 14:19:51,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 14:19:51,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:51,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:51,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:19:51,702 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:19:51,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2022-10-16 14:19:51,720 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-10-16 14:19:51,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-10-16 14:19:52,389 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-10-16 14:19:52,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 14:19:52,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:52,643 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-10-16 14:19:52,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 88 [2022-10-16 14:19:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:52,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:52,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:52,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-10-16 14:19:53,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:19:53,497 INFO L356 Elim1Store]: treesize reduction 101, result has 15.1 percent of original size [2022-10-16 14:19:53,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 235 treesize of output 131 [2022-10-16 14:19:53,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 84 [2022-10-16 14:19:53,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2022-10-16 14:19:53,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-10-16 14:19:53,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:19:53,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2022-10-16 14:19:53,824 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 14:19:53,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 109 [2022-10-16 14:19:53,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:53,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2022-10-16 14:19:55,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:19:55,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:55,405 INFO L356 Elim1Store]: treesize reduction 174, result has 7.4 percent of original size [2022-10-16 14:19:55,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 302 treesize of output 140 [2022-10-16 14:19:55,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:55,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:55,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:19:55,444 INFO L356 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-10-16 14:19:55,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 40 [2022-10-16 14:19:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 253 proven. 25 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-10-16 14:19:55,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:20:52,780 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:20:54,837 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) (.cse10 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse11 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (and (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse3 (let ((.cse12 (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1632) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_1644) .cse11 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|)))) (store .cse12 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse7 v_ArrVal_1646)))) (.cse0 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse9 .cse10 v_ArrVal_1642) .cse11 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse7 v_ArrVal_1645))))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ 4 (select (select .cse3 .cse4) .cse5)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 0)) (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse14 (let ((.cse21 (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1632) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_1644) .cse11 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|)))) (store .cse21 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse7 v_ArrVal_1646)))) (.cse15 (let ((.cse20 (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse9 .cse10 v_ArrVal_1642) .cse11 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)))) (store .cse20 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse7 v_ArrVal_1645))))) (let ((.cse18 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse16 (select (select .cse15 .cse18) .cse19)) (.cse17 (+ 4 (select (select .cse14 .cse18) .cse19)))) (select (select .cse14 (select (select .cse15 .cse16) .cse17)) (+ (select (select .cse14 .cse16) .cse17) 4))))) 0)))))) is different from false [2022-10-16 14:20:57,033 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse24 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse25 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse15 (select .cse24 .cse25)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse26 .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (.cse7 (select .cse26 .cse25)) (.cse8 (+ .cse15 8)) (.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse24 .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) (.cse11 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse12 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (and (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse3 (let ((.cse13 (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1632) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse11 v_ArrVal_1644) .cse12 .cse15)))) (store .cse13 .cse7 (store (select .cse13 .cse7) .cse8 v_ArrVal_1646)))) (.cse0 (let ((.cse6 (store .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse10 .cse11 v_ArrVal_1642) .cse12 .cse7)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_1645))))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 0)) (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse16 (let ((.cse23 (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1632) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse11 v_ArrVal_1644) .cse12 .cse15)))) (store .cse23 .cse7 (store (select .cse23 .cse7) .cse8 v_ArrVal_1646)))) (.cse17 (let ((.cse22 (store .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse10 .cse11 v_ArrVal_1642) .cse12 .cse7)))) (store .cse22 .cse7 (store (select .cse22 .cse7) .cse8 v_ArrVal_1645))))) (let ((.cse20 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse21 (+ (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse18 (select (select .cse17 .cse20) .cse21)) (.cse19 (+ (select (select .cse16 .cse20) .cse21) 4))) (select (select .cse16 (select (select .cse17 .cse18) .cse19)) (+ (select (select .cse16 .cse18) .cse19) 4))))) 0)))))) is different from false [2022-10-16 14:20:59,120 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$.base| .cse15)) (.cse25 (select |c_#memory_$Pointer$.offset| .cse15)) (.cse26 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse16 (select .cse25 .cse26)) (.cse9 (store |c_#memory_$Pointer$.base| .cse15 (store .cse27 .cse26 |c_ULTIMATE.start_node_create_#res#1.base|)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_node_create_#res#1.base|)) (.cse7 (select .cse27 .cse26)) (.cse8 (+ .cse16 8)) (.cse14 (store |c_#memory_$Pointer$.offset| .cse15 (store .cse25 .cse26 |c_ULTIMATE.start_node_create_#res#1.offset|))) (.cse11 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (and (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse0 (let ((.cse13 (store .cse14 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_1632) |c_ULTIMATE.start_node_create_#res#1.base|) .cse11 v_ArrVal_1644) .cse12 .cse16)))) (store .cse13 .cse7 (store (select .cse13 .cse7) .cse8 v_ArrVal_1646)))) (.cse1 (let ((.cse6 (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse10 .cse11 v_ArrVal_1642) .cse12 .cse7)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_1645))))) (let ((.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse4) .cse5)) (.cse3 (+ (select (select .cse0 .cse4) .cse5) 4))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4))))) 0)) (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse20 (let ((.cse24 (store .cse14 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_1632) |c_ULTIMATE.start_node_create_#res#1.base|) .cse11 v_ArrVal_1644) .cse12 .cse16)))) (store .cse24 .cse7 (store (select .cse24 .cse7) .cse8 v_ArrVal_1646)))) (.cse17 (let ((.cse23 (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse10 .cse11 v_ArrVal_1642) .cse12 .cse7)))) (store .cse23 .cse7 (store (select .cse23 .cse7) .cse8 v_ArrVal_1645))))) (let ((.cse21 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (+ (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse18 (select (select .cse17 .cse21) .cse22)) (.cse19 (+ (select (select .cse20 .cse21) .cse22) 4))) (select (select .cse17 (select (select .cse17 .cse18) .cse19)) (+ (select (select .cse20 .cse18) .cse19) 4))))) 0))))))) is different from false [2022-10-16 14:21:01,246 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse11 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1630))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1631)) (.cse13 (select (select .cse12 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse18 (select .cse17 .cse13)) (.cse15 (+ (select (select .cse17 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse19 (select .cse18 .cse15)) (.cse14 (select .cse12 .cse13))) (let ((.cse7 (select .cse14 .cse15)) (.cse8 (+ .cse19 8))) (let ((.cse3 (let ((.cse16 (store (store .cse17 .cse13 (store .cse18 .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse17 .cse13 v_ArrVal_1632) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1644) .cse11 .cse19)))) (store .cse16 .cse7 (store (select .cse16 .cse7) .cse8 v_ArrVal_1646)))) (.cse0 (let ((.cse6 (let ((.cse9 (store .cse12 .cse13 (store .cse14 .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (store .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse7))))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_1645))))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))))))) 0)) (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (= (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1630))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1631)) (.cse31 (select (select .cse30 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse36 (select .cse35 .cse31)) (.cse33 (+ (select (select .cse35 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse37 (select .cse36 .cse33)) (.cse32 (select .cse30 .cse31))) (let ((.cse27 (select .cse32 .cse33)) (.cse28 (+ .cse37 8))) (let ((.cse20 (let ((.cse34 (store (store .cse35 .cse31 (store .cse36 .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse35 .cse31 v_ArrVal_1632) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1644) .cse11 .cse37)))) (store .cse34 .cse27 (store (select .cse34 .cse27) .cse28 v_ArrVal_1646)))) (.cse21 (let ((.cse26 (let ((.cse29 (store .cse30 .cse31 (store .cse32 .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (store .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse27))))) (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 v_ArrVal_1645))))) (let ((.cse24 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (+ 4 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse22 (select (select .cse21 .cse24) .cse25)) (.cse23 (+ (select (select .cse20 .cse24) .cse25) 4))) (select (select .cse20 (select (select .cse21 .cse22) .cse23)) (+ (select (select .cse20 .cse22) .cse23) 4)))))))))) 0)))) is different from false [2022-10-16 14:21:36,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:21:36,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21599 treesize of output 15775 [2022-10-16 14:21:36,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:21:36,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15779 treesize of output 11935 [2022-10-16 14:21:37,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:21:37,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21335 treesize of output 15751 [2022-10-16 14:21:37,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:21:37,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15755 treesize of output 11791 [2022-10-16 14:21:37,803 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1627 Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1629 Int) (v_ArrVal_1632 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_6| Int) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (let ((.cse0 (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_5))) (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 v_ArrVal_1629)))) (.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 v_ArrVal_1627))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select v_arrayElimArr_4 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_6|) 0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_5 .cse1))) (= (let ((.cse12 (store .cse20 |v_ULTIMATE.start_node_create_~temp~0#1.base_6| v_ArrVal_1630))) (let ((.cse17 (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_6| v_ArrVal_1631)) (.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (select .cse17 .cse13)) (.cse15 (+ 4 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse19 (select .cse18 .cse15)) (.cse14 (select .cse12 .cse13))) (let ((.cse9 (select .cse14 .cse15)) (.cse10 (+ .cse19 8))) (let ((.cse5 (let ((.cse16 (store (store .cse17 .cse13 (store .cse18 .cse15 0)) |v_ULTIMATE.start_node_create_~temp~0#1.base_6| (store (store (select (store .cse17 .cse13 v_ArrVal_1632) |v_ULTIMATE.start_node_create_~temp~0#1.base_6|) 8 v_ArrVal_1644) 4 .cse19)))) (store .cse16 .cse9 (store (select .cse16 .cse9) .cse10 v_ArrVal_1646)))) (.cse2 (let ((.cse8 (let ((.cse11 (store .cse12 .cse13 (store .cse14 .cse15 |v_ULTIMATE.start_node_create_~temp~0#1.base_6|)))) (store .cse11 |v_ULTIMATE.start_node_create_~temp~0#1.base_6| (store (store (select .cse11 |v_ULTIMATE.start_node_create_~temp~0#1.base_6|) 8 v_ArrVal_1642) 4 .cse9))))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_ArrVal_1645))))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ 4 (select (select .cse5 .cse6) .cse7)))) (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))))))))) 0) (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_6| |c_#StackHeapBarrier|)) (not (= (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1627 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1629 Int) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_6| Int) (v_ArrVal_1642 Int) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1645 Int)) (let ((.cse43 (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_6))) (store .cse45 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 v_ArrVal_1627)))) (.cse42 (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_7))) (store .cse44 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 v_ArrVal_1629))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_6|) 0)) (= (let ((.cse34 (store .cse43 |v_ULTIMATE.start_node_create_~temp~0#1.base_6| v_ArrVal_1630))) (let ((.cse39 (store .cse42 |v_ULTIMATE.start_node_create_~temp~0#1.base_6| v_ArrVal_1631)) (.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (select .cse39 .cse35)) (.cse37 (+ (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse41 (select .cse40 .cse37)) (.cse36 (select .cse34 .cse35))) (let ((.cse31 (select .cse36 .cse37)) (.cse32 (+ .cse41 8))) (let ((.cse24 (let ((.cse38 (store (store .cse39 .cse35 (store .cse40 .cse37 0)) |v_ULTIMATE.start_node_create_~temp~0#1.base_6| (store (store (select (store .cse39 .cse35 v_ArrVal_1632) |v_ULTIMATE.start_node_create_~temp~0#1.base_6|) 8 v_ArrVal_1644) 4 .cse41)))) (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 v_ArrVal_1646)))) (.cse25 (let ((.cse30 (let ((.cse33 (store .cse34 .cse35 (store .cse36 .cse37 |v_ULTIMATE.start_node_create_~temp~0#1.base_6|)))) (store .cse33 |v_ULTIMATE.start_node_create_~temp~0#1.base_6| (store (store (select .cse33 |v_ULTIMATE.start_node_create_~temp~0#1.base_6|) 8 v_ArrVal_1642) 4 .cse31))))) (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 v_ArrVal_1645))))) (let ((.cse28 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (+ (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse26 (select (select .cse25 .cse28) .cse29)) (.cse27 (+ (select (select .cse24 .cse28) .cse29) 4))) (select (select .cse24 (select (select .cse25 .cse26) .cse27)) (+ (select (select .cse24 .cse26) .cse27) 4)))))))))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select v_arrayElimArr_6 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_6| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_7 .cse1))) (not (= (select (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) is different from false [2022-10-16 14:22:20,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:22:20,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26439 treesize of output 17699 [2022-10-16 14:22:20,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:22:20,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17709 treesize of output 11939 [2022-10-16 14:22:20,972 INFO L173 IndexEqualityManager]: detected equality via solver