/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/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:01:09,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:01:09,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:01:09,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:01:09,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:01:09,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:01:09,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:01:09,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:01:09,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:01:09,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:01:09,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:01:09,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:01:09,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:01:09,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:01:09,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:01:09,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:01:09,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:01:09,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:01:09,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:01:09,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:01:09,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:01:09,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:01:09,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:01:09,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:01:09,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:01:09,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:01:09,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:01:09,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:01:09,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:01:09,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:01:09,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:01:09,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:01:09,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:01:09,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:01:09,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:01:09,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:01:09,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:01:09,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:01:09,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:01:09,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:01:09,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:01:09,572 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 17:01:09,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:01:09,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:01:09,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:01:09,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:01:09,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:01:09,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:01:09,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:01:09,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:01:09,607 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:01:09,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:01:09,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:01:09,610 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:01:09,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:01:09,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:01:09,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:01:09,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:01:09,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:01:09,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:01:09,611 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:01:09,611 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:01:09,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:01:09,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:01:09,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:01:09,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:01:09,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:01:09,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:01:09,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:01:09,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:01:09,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:01:09,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:01:09,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:01:09,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:01:09,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:01:09,614 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 17:01:09,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:01:09,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:01:09,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:01:09,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:01:09,996 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:01:09,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-10-16 17:01:10,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c4ee1a/6585f3ff1c9a4a3aa5a5b317fbd2cdd3/FLAG044f2db03 [2022-10-16 17:01:10,670 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:01:10,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-10-16 17:01:10,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c4ee1a/6585f3ff1c9a4a3aa5a5b317fbd2cdd3/FLAG044f2db03 [2022-10-16 17:01:11,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c4ee1a/6585f3ff1c9a4a3aa5a5b317fbd2cdd3 [2022-10-16 17:01:11,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:01:11,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:01:11,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:01:11,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:01:11,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:01:11,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50328388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11, skipping insertion in model container [2022-10-16 17:01:11,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:01:11,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:01:11,258 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/systemc/token_ring.02.cil-2.c[671,684] [2022-10-16 17:01:11,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:01:11,335 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:01:11,353 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/systemc/token_ring.02.cil-2.c[671,684] [2022-10-16 17:01:11,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:01:11,425 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:01:11,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11 WrapperNode [2022-10-16 17:01:11,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:01:11,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:01:11,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:01:11,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:01:11,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,507 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 284 [2022-10-16 17:01:11,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:01:11,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:01:11,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:01:11,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:01:11,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,580 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:01:11,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:01:11,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:01:11,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:01:11,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (1/1) ... [2022-10-16 17:01:11,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:01:11,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:01:11,634 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 17:01:11,649 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 17:01:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 17:01:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-10-16 17:01:11,696 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-10-16 17:01:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-16 17:01:11,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-16 17:01:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-16 17:01:11,697 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-16 17:01:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-16 17:01:11,700 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-16 17:01:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-16 17:01:11,701 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-16 17:01:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-16 17:01:11,701 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-16 17:01:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 17:01:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-16 17:01:11,702 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-16 17:01:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:01:11,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:01:11,857 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:01:11,859 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:01:12,444 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:01:12,455 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:01:12,455 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-16 17:01:12,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:12 BoogieIcfgContainer [2022-10-16 17:01:12,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:01:12,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:01:12,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:01:12,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:01:12,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:01:11" (1/3) ... [2022-10-16 17:01:12,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5a1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:12, skipping insertion in model container [2022-10-16 17:01:12,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:11" (2/3) ... [2022-10-16 17:01:12,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5a1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:12, skipping insertion in model container [2022-10-16 17:01:12,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:12" (3/3) ... [2022-10-16 17:01:12,468 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2022-10-16 17:01:12,488 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:01:12,488 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-16 17:01:12,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:01:12,562 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;@424336ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:01:12,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-16 17:01:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 117 states have (on average 1.606837606837607) internal successors, (188), 126 states have internal predecessors, (188), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-10-16 17:01:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:12,583 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:12,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:12,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1140351228, now seen corresponding path program 1 times [2022-10-16 17:01:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:12,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706021710] [2022-10-16 17:01:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:13,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:13,108 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 17:01:13,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:13,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706021710] [2022-10-16 17:01:13,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706021710] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:13,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:13,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:01:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024866369] [2022-10-16 17:01:13,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:13,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:01:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:01:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:01:13,166 INFO L87 Difference]: Start difference. First operand has 149 states, 117 states have (on average 1.606837606837607) internal successors, (188), 126 states have internal predecessors, (188), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:13,764 INFO L93 Difference]: Finished difference Result 322 states and 494 transitions. [2022-10-16 17:01:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:01:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-10-16 17:01:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:13,782 INFO L225 Difference]: With dead ends: 322 [2022-10-16 17:01:13,782 INFO L226 Difference]: Without dead ends: 172 [2022-10-16 17:01:13,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:13,793 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 305 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:13,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 396 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-10-16 17:01:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2022-10-16 17:01:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 118 states have internal predecessors, (169), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-10-16 17:01:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2022-10-16 17:01:13,870 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 66 [2022-10-16 17:01:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:13,870 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2022-10-16 17:01:13,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2022-10-16 17:01:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:13,875 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:13,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:13,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:01:13,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1701051006, now seen corresponding path program 1 times [2022-10-16 17:01:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:13,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582182196] [2022-10-16 17:01:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,346 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 17:01:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582182196] [2022-10-16 17:01:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582182196] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:14,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:14,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:14,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596466519] [2022-10-16 17:01:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:14,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:14,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:14,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:14,357 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:15,127 INFO L93 Difference]: Finished difference Result 462 states and 682 transitions. [2022-10-16 17:01:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:15,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-10-16 17:01:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:15,132 INFO L225 Difference]: With dead ends: 462 [2022-10-16 17:01:15,133 INFO L226 Difference]: Without dead ends: 332 [2022-10-16 17:01:15,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:01:15,136 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 420 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:15,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 607 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-10-16 17:01:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 265. [2022-10-16 17:01:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.5205479452054795) internal successors, (333), 226 states have internal predecessors, (333), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-10-16 17:01:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 390 transitions. [2022-10-16 17:01:15,186 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 390 transitions. Word has length 66 [2022-10-16 17:01:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:15,187 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 390 transitions. [2022-10-16 17:01:15,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 390 transitions. [2022-10-16 17:01:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:15,190 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:15,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:15,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:01:15,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash -959045506, now seen corresponding path program 1 times [2022-10-16 17:01:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:15,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261794932] [2022-10-16 17:01:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,461 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 17:01:15,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:15,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261794932] [2022-10-16 17:01:15,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261794932] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:15,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:15,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285353782] [2022-10-16 17:01:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:15,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:15,468 INFO L87 Difference]: Start difference. First operand 265 states and 390 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:16,376 INFO L93 Difference]: Finished difference Result 743 states and 1102 transitions. [2022-10-16 17:01:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:01:16,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-10-16 17:01:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:16,382 INFO L225 Difference]: With dead ends: 743 [2022-10-16 17:01:16,382 INFO L226 Difference]: Without dead ends: 488 [2022-10-16 17:01:16,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-16 17:01:16,386 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 410 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:16,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1066 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-10-16 17:01:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 383. [2022-10-16 17:01:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 319 states have (on average 1.5141065830721003) internal successors, (483), 327 states have internal predecessors, (483), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-10-16 17:01:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 564 transitions. [2022-10-16 17:01:16,471 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 564 transitions. Word has length 66 [2022-10-16 17:01:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:16,471 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 564 transitions. [2022-10-16 17:01:16,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 564 transitions. [2022-10-16 17:01:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:16,482 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:16,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:16,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 17:01:16,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -515144832, now seen corresponding path program 1 times [2022-10-16 17:01:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:16,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778994939] [2022-10-16 17:01:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:16,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:16,677 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 17:01:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:16,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778994939] [2022-10-16 17:01:16,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778994939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:16,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:16,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205564521] [2022-10-16 17:01:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:16,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:16,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:16,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:16,681 INFO L87 Difference]: Start difference. First operand 383 states and 564 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:17,503 INFO L93 Difference]: Finished difference Result 1156 states and 1720 transitions. [2022-10-16 17:01:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:01:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-10-16 17:01:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:17,511 INFO L225 Difference]: With dead ends: 1156 [2022-10-16 17:01:17,511 INFO L226 Difference]: Without dead ends: 783 [2022-10-16 17:01:17,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-16 17:01:17,515 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 442 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:17,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 726 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-10-16 17:01:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 620. [2022-10-16 17:01:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 520 states have (on average 1.5076923076923077) internal successors, (784), 530 states have internal predecessors, (784), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-10-16 17:01:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 917 transitions. [2022-10-16 17:01:17,637 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 917 transitions. Word has length 66 [2022-10-16 17:01:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:17,638 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 917 transitions. [2022-10-16 17:01:17,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 917 transitions. [2022-10-16 17:01:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:17,641 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:17,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:17,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 17:01:17,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1023195198, now seen corresponding path program 1 times [2022-10-16 17:01:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590285381] [2022-10-16 17:01:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,788 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 17:01:17,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:17,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590285381] [2022-10-16 17:01:17,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590285381] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:17,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:17,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:17,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759711017] [2022-10-16 17:01:17,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:17,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:17,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:17,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:17,792 INFO L87 Difference]: Start difference. First operand 620 states and 917 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:18,772 INFO L93 Difference]: Finished difference Result 2054 states and 3059 transitions. [2022-10-16 17:01:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:01:18,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-10-16 17:01:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:18,783 INFO L225 Difference]: With dead ends: 2054 [2022-10-16 17:01:18,783 INFO L226 Difference]: Without dead ends: 1444 [2022-10-16 17:01:18,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:01:18,787 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 416 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:18,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1064 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 17:01:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-10-16 17:01:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1040. [2022-10-16 17:01:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 872 states have (on average 1.5) internal successors, (1308), 886 states have internal predecessors, (1308), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2022-10-16 17:01:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1543 transitions. [2022-10-16 17:01:18,911 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1543 transitions. Word has length 66 [2022-10-16 17:01:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:18,911 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 1543 transitions. [2022-10-16 17:01:18,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1543 transitions. [2022-10-16 17:01:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:18,914 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:18,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:18,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 17:01:18,915 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:18,915 INFO L85 PathProgramCache]: Analyzing trace with hash 542114940, now seen corresponding path program 1 times [2022-10-16 17:01:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:18,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613128295] [2022-10-16 17:01:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:19,048 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 17:01:19,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:19,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613128295] [2022-10-16 17:01:19,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613128295] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:19,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:19,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870307114] [2022-10-16 17:01:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:19,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:19,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:19,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:19,051 INFO L87 Difference]: Start difference. First operand 1040 states and 1543 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:20,045 INFO L93 Difference]: Finished difference Result 3476 states and 5171 transitions. [2022-10-16 17:01:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:01:20,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-10-16 17:01:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:20,062 INFO L225 Difference]: With dead ends: 3476 [2022-10-16 17:01:20,062 INFO L226 Difference]: Without dead ends: 2446 [2022-10-16 17:01:20,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:01:20,067 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 421 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:20,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1036 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2022-10-16 17:01:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 1913. [2022-10-16 17:01:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1613 states have (on average 1.4941103533787972) internal successors, (2410), 1635 states have internal predecessors, (2410), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-10-16 17:01:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2859 transitions. [2022-10-16 17:01:20,278 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2859 transitions. Word has length 66 [2022-10-16 17:01:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:20,278 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2859 transitions. [2022-10-16 17:01:20,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2859 transitions. [2022-10-16 17:01:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:20,281 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:20,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:20,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 17:01:20,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 526596222, now seen corresponding path program 1 times [2022-10-16 17:01:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:20,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498862497] [2022-10-16 17:01:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:20,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:20,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:20,376 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 17:01:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:20,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498862497] [2022-10-16 17:01:20,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498862497] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:20,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:20,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680989581] [2022-10-16 17:01:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:20,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:20,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:20,379 INFO L87 Difference]: Start difference. First operand 1913 states and 2859 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:21,320 INFO L93 Difference]: Finished difference Result 5361 states and 8029 transitions. [2022-10-16 17:01:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:21,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-10-16 17:01:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:21,344 INFO L225 Difference]: With dead ends: 5361 [2022-10-16 17:01:21,344 INFO L226 Difference]: Without dead ends: 3459 [2022-10-16 17:01:21,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-10-16 17:01:21,354 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 550 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:21,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 799 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:01:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2022-10-16 17:01:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 2868. [2022-10-16 17:01:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2410 states have (on average 1.4751037344398341) internal successors, (3555), 2449 states have internal predecessors, (3555), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-10-16 17:01:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 4224 transitions. [2022-10-16 17:01:21,695 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 4224 transitions. Word has length 66 [2022-10-16 17:01:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:21,696 INFO L495 AbstractCegarLoop]: Abstraction has 2868 states and 4224 transitions. [2022-10-16 17:01:21,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 4224 transitions. [2022-10-16 17:01:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:21,699 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:21,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:21,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 17:01:21,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash 579540116, now seen corresponding path program 1 times [2022-10-16 17:01:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:21,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729338459] [2022-10-16 17:01:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,863 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 17:01:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729338459] [2022-10-16 17:01:21,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729338459] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:21,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:21,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941763616] [2022-10-16 17:01:21,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:21,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:21,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:21,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:21,869 INFO L87 Difference]: Start difference. First operand 2868 states and 4224 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:22,836 INFO L93 Difference]: Finished difference Result 6517 states and 9702 transitions. [2022-10-16 17:01:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 17:01:22,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:22,862 INFO L225 Difference]: With dead ends: 6517 [2022-10-16 17:01:22,862 INFO L226 Difference]: Without dead ends: 3660 [2022-10-16 17:01:22,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-10-16 17:01:22,875 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 262 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:22,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 703 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2022-10-16 17:01:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 2895. [2022-10-16 17:01:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2437 states have (on average 1.4628641772671318) internal successors, (3565), 2476 states have internal predecessors, (3565), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-10-16 17:01:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4234 transitions. [2022-10-16 17:01:23,228 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4234 transitions. Word has length 67 [2022-10-16 17:01:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:23,229 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 4234 transitions. [2022-10-16 17:01:23,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4234 transitions. [2022-10-16 17:01:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:23,232 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:23,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:23,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 17:01:23,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1003186838, now seen corresponding path program 1 times [2022-10-16 17:01:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:23,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6022435] [2022-10-16 17:01:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:23,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:23,362 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 17:01:23,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:23,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6022435] [2022-10-16 17:01:23,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6022435] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:23,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:23,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:23,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981513841] [2022-10-16 17:01:23,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:23,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:23,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:23,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:23,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:23,365 INFO L87 Difference]: Start difference. First operand 2895 states and 4234 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:24,498 INFO L93 Difference]: Finished difference Result 6807 states and 10065 transitions. [2022-10-16 17:01:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 17:01:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:24,528 INFO L225 Difference]: With dead ends: 6807 [2022-10-16 17:01:24,529 INFO L226 Difference]: Without dead ends: 3923 [2022-10-16 17:01:24,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-10-16 17:01:24,542 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 262 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:24,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 695 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2022-10-16 17:01:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 2973. [2022-10-16 17:01:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2973 states, 2515 states have (on average 1.4485089463220675) internal successors, (3643), 2554 states have internal predecessors, (3643), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-10-16 17:01:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 4312 transitions. [2022-10-16 17:01:24,931 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 4312 transitions. Word has length 67 [2022-10-16 17:01:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:24,931 INFO L495 AbstractCegarLoop]: Abstraction has 2973 states and 4312 transitions. [2022-10-16 17:01:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 4312 transitions. [2022-10-16 17:01:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:24,935 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:24,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:24,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 17:01:24,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 159181336, now seen corresponding path program 1 times [2022-10-16 17:01:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:24,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685217178] [2022-10-16 17:01:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:25,080 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 17:01:25,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:25,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685217178] [2022-10-16 17:01:25,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685217178] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:25,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:25,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:25,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051769203] [2022-10-16 17:01:25,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:25,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:25,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:25,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:25,083 INFO L87 Difference]: Start difference. First operand 2973 states and 4312 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:27,174 INFO L93 Difference]: Finished difference Result 10631 states and 15675 transitions. [2022-10-16 17:01:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:27,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:27,229 INFO L225 Difference]: With dead ends: 10631 [2022-10-16 17:01:27,229 INFO L226 Difference]: Without dead ends: 7669 [2022-10-16 17:01:27,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-10-16 17:01:27,247 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 1042 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:27,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 868 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 17:01:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2022-10-16 17:01:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6563. [2022-10-16 17:01:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6563 states, 5533 states have (on average 1.4333996023856859) internal successors, (7931), 5631 states have internal predecessors, (7931), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2022-10-16 17:01:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 9523 transitions. [2022-10-16 17:01:28,238 INFO L78 Accepts]: Start accepts. Automaton has 6563 states and 9523 transitions. Word has length 67 [2022-10-16 17:01:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:28,238 INFO L495 AbstractCegarLoop]: Abstraction has 6563 states and 9523 transitions. [2022-10-16 17:01:28,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6563 states and 9523 transitions. [2022-10-16 17:01:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:28,241 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:28,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:28,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 17:01:28,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1417376423, now seen corresponding path program 1 times [2022-10-16 17:01:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:28,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412967902] [2022-10-16 17:01:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:28,364 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 17:01:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:28,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412967902] [2022-10-16 17:01:28,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412967902] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:28,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:28,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16216496] [2022-10-16 17:01:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:28,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:28,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:28,367 INFO L87 Difference]: Start difference. First operand 6563 states and 9523 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:29,808 INFO L93 Difference]: Finished difference Result 14527 states and 21622 transitions. [2022-10-16 17:01:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 17:01:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:29,859 INFO L225 Difference]: With dead ends: 14527 [2022-10-16 17:01:29,859 INFO L226 Difference]: Without dead ends: 7975 [2022-10-16 17:01:29,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-10-16 17:01:29,885 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 179 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:29,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 688 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:01:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states. [2022-10-16 17:01:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 6668. [2022-10-16 17:01:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 5638 states have (on average 1.4207165661582122) internal successors, (8010), 5736 states have internal predecessors, (8010), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2022-10-16 17:01:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9602 transitions. [2022-10-16 17:01:30,767 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9602 transitions. Word has length 67 [2022-10-16 17:01:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:30,767 INFO L495 AbstractCegarLoop]: Abstraction has 6668 states and 9602 transitions. [2022-10-16 17:01:30,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9602 transitions. [2022-10-16 17:01:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:30,771 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:30,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:30,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 17:01:30,772 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -31173029, now seen corresponding path program 1 times [2022-10-16 17:01:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:30,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766842596] [2022-10-16 17:01:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:30,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:30,969 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 17:01:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:30,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766842596] [2022-10-16 17:01:30,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766842596] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:30,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:30,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559020709] [2022-10-16 17:01:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:30,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:30,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:30,972 INFO L87 Difference]: Start difference. First operand 6668 states and 9602 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:32,234 INFO L93 Difference]: Finished difference Result 8755 states and 12684 transitions. [2022-10-16 17:01:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 17:01:32,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:32,261 INFO L225 Difference]: With dead ends: 8755 [2022-10-16 17:01:32,261 INFO L226 Difference]: Without dead ends: 5048 [2022-10-16 17:01:32,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-10-16 17:01:32,276 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 672 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:32,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 695 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:01:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2022-10-16 17:01:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 4128. [2022-10-16 17:01:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 3481 states have (on average 1.4036196495259983) internal successors, (4886), 3539 states have internal predecessors, (4886), 387 states have call successors, (387), 226 states have call predecessors, (387), 254 states have return successors, (556), 370 states have call predecessors, (556), 387 states have call successors, (556) [2022-10-16 17:01:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 5829 transitions. [2022-10-16 17:01:32,853 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 5829 transitions. Word has length 67 [2022-10-16 17:01:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:32,854 INFO L495 AbstractCegarLoop]: Abstraction has 4128 states and 5829 transitions. [2022-10-16 17:01:32,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 5829 transitions. [2022-10-16 17:01:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:32,856 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:32,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:32,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 17:01:32,857 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash -165186535, now seen corresponding path program 1 times [2022-10-16 17:01:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:32,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78173018] [2022-10-16 17:01:32,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:32,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:33,014 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 17:01:33,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:33,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78173018] [2022-10-16 17:01:33,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78173018] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:33,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:33,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:33,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492720141] [2022-10-16 17:01:33,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:33,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:33,017 INFO L87 Difference]: Start difference. First operand 4128 states and 5829 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:34,906 INFO L93 Difference]: Finished difference Result 12796 states and 18214 transitions. [2022-10-16 17:01:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:34,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:34,945 INFO L225 Difference]: With dead ends: 12796 [2022-10-16 17:01:34,945 INFO L226 Difference]: Without dead ends: 8680 [2022-10-16 17:01:34,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-10-16 17:01:34,963 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 559 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:34,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 800 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2022-10-16 17:01:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 7088. [2022-10-16 17:01:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 5970 states have (on average 1.3871021775544388) internal successors, (8281), 6095 states have internal predecessors, (8281), 643 states have call successors, (643), 390 states have call predecessors, (643), 469 states have return successors, (994), 618 states have call predecessors, (994), 643 states have call successors, (994) [2022-10-16 17:01:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 9918 transitions. [2022-10-16 17:01:36,058 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 9918 transitions. Word has length 67 [2022-10-16 17:01:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:36,058 INFO L495 AbstractCegarLoop]: Abstraction has 7088 states and 9918 transitions. [2022-10-16 17:01:36,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 9918 transitions. [2022-10-16 17:01:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:36,063 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:36,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:36,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 17:01:36,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash 53668183, now seen corresponding path program 1 times [2022-10-16 17:01:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:36,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355385584] [2022-10-16 17:01:36,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:36,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:36,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:36,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:36,240 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 17:01:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:36,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355385584] [2022-10-16 17:01:36,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355385584] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:36,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:36,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399931915] [2022-10-16 17:01:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:36,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:36,243 INFO L87 Difference]: Start difference. First operand 7088 states and 9918 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:38,040 INFO L93 Difference]: Finished difference Result 13144 states and 18312 transitions. [2022-10-16 17:01:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:38,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:38,072 INFO L225 Difference]: With dead ends: 13144 [2022-10-16 17:01:38,073 INFO L226 Difference]: Without dead ends: 7604 [2022-10-16 17:01:38,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-10-16 17:01:38,094 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 481 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:38,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 786 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7604 states. [2022-10-16 17:01:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7604 to 5932. [2022-10-16 17:01:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5932 states, 5026 states have (on average 1.3631118185435733) internal successors, (6851), 5127 states have internal predecessors, (6851), 519 states have call successors, (519), 326 states have call predecessors, (519), 381 states have return successors, (774), 486 states have call predecessors, (774), 519 states have call successors, (774) [2022-10-16 17:01:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5932 states to 5932 states and 8144 transitions. [2022-10-16 17:01:38,942 INFO L78 Accepts]: Start accepts. Automaton has 5932 states and 8144 transitions. Word has length 67 [2022-10-16 17:01:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:38,942 INFO L495 AbstractCegarLoop]: Abstraction has 5932 states and 8144 transitions. [2022-10-16 17:01:38,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5932 states and 8144 transitions. [2022-10-16 17:01:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:38,945 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:38,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:38,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 17:01:38,945 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 476370009, now seen corresponding path program 1 times [2022-10-16 17:01:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:38,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149154572] [2022-10-16 17:01:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:39,107 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 17:01:39,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:39,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149154572] [2022-10-16 17:01:39,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149154572] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:39,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:39,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845842045] [2022-10-16 17:01:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:39,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:39,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:39,109 INFO L87 Difference]: Start difference. First operand 5932 states and 8144 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:41,177 INFO L93 Difference]: Finished difference Result 11136 states and 15377 transitions. [2022-10-16 17:01:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:41,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:41,212 INFO L225 Difference]: With dead ends: 11136 [2022-10-16 17:01:41,212 INFO L226 Difference]: Without dead ends: 7546 [2022-10-16 17:01:41,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-10-16 17:01:41,225 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 652 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:41,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 679 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:01:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2022-10-16 17:01:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 5899. [2022-10-16 17:01:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5899 states, 5003 states have (on average 1.3565860483709775) internal successors, (6787), 5094 states have internal predecessors, (6787), 519 states have call successors, (519), 326 states have call predecessors, (519), 371 states have return successors, (730), 482 states have call predecessors, (730), 519 states have call successors, (730) [2022-10-16 17:01:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5899 states to 5899 states and 8036 transitions. [2022-10-16 17:01:42,075 INFO L78 Accepts]: Start accepts. Automaton has 5899 states and 8036 transitions. Word has length 67 [2022-10-16 17:01:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:42,075 INFO L495 AbstractCegarLoop]: Abstraction has 5899 states and 8036 transitions. [2022-10-16 17:01:42,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5899 states and 8036 transitions. [2022-10-16 17:01:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:42,077 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:42,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:42,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 17:01:42,078 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash -341278441, now seen corresponding path program 1 times [2022-10-16 17:01:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:42,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132658897] [2022-10-16 17:01:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:42,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:42,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:42,192 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 17:01:42,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:42,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132658897] [2022-10-16 17:01:42,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132658897] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:42,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:42,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780942132] [2022-10-16 17:01:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:42,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:42,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:42,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:42,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:42,197 INFO L87 Difference]: Start difference. First operand 5899 states and 8036 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:44,306 INFO L93 Difference]: Finished difference Result 16795 states and 23244 transitions. [2022-10-16 17:01:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-16 17:01:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:44,351 INFO L225 Difference]: With dead ends: 16795 [2022-10-16 17:01:44,351 INFO L226 Difference]: Without dead ends: 10910 [2022-10-16 17:01:44,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-16 17:01:44,368 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 561 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:44,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 451 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10910 states. [2022-10-16 17:01:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10910 to 9192. [2022-10-16 17:01:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9192 states, 7800 states have (on average 1.3425641025641026) internal successors, (10472), 7928 states have internal predecessors, (10472), 788 states have call successors, (788), 506 states have call predecessors, (788), 598 states have return successors, (1266), 761 states have call predecessors, (1266), 788 states have call successors, (1266) [2022-10-16 17:01:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9192 states to 9192 states and 12526 transitions. [2022-10-16 17:01:45,644 INFO L78 Accepts]: Start accepts. Automaton has 9192 states and 12526 transitions. Word has length 67 [2022-10-16 17:01:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:45,645 INFO L495 AbstractCegarLoop]: Abstraction has 9192 states and 12526 transitions. [2022-10-16 17:01:45,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:01:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 9192 states and 12526 transitions. [2022-10-16 17:01:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 17:01:45,647 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:45,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:45,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 17:01:45,648 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1596133247, now seen corresponding path program 1 times [2022-10-16 17:01:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:45,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641023553] [2022-10-16 17:01:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:45,719 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 17:01:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641023553] [2022-10-16 17:01:45,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641023553] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:45,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:45,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:01:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802362127] [2022-10-16 17:01:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:45,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:01:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:01:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:01:45,722 INFO L87 Difference]: Start difference. First operand 9192 states and 12526 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 17:01:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:48,197 INFO L93 Difference]: Finished difference Result 25942 states and 35629 transitions. [2022-10-16 17:01:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:01:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2022-10-16 17:01:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:48,267 INFO L225 Difference]: With dead ends: 25942 [2022-10-16 17:01:48,267 INFO L226 Difference]: Without dead ends: 16674 [2022-10-16 17:01:48,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 17:01:48,298 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 463 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:48,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 438 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:01:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16674 states. [2022-10-16 17:01:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16674 to 14116. [2022-10-16 17:01:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14116 states, 11940 states have (on average 1.3276381909547739) internal successors, (15852), 12138 states have internal predecessors, (15852), 1224 states have call successors, (1224), 800 states have call predecessors, (1224), 946 states have return successors, (1951), 1181 states have call predecessors, (1951), 1224 states have call successors, (1951) [2022-10-16 17:01:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 19027 transitions. [2022-10-16 17:01:50,266 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 19027 transitions. Word has length 68 [2022-10-16 17:01:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:50,266 INFO L495 AbstractCegarLoop]: Abstraction has 14116 states and 19027 transitions. [2022-10-16 17:01:50,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 17:01:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 19027 transitions. [2022-10-16 17:01:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-10-16 17:01:50,270 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:50,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:50,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 17:01:50,270 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash 660145097, now seen corresponding path program 1 times [2022-10-16 17:01:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:50,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510673968] [2022-10-16 17:01:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:50,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:50,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:01:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 17:01:50,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510673968] [2022-10-16 17:01:50,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510673968] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:50,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:50,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544093622] [2022-10-16 17:01:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:50,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:50,419 INFO L87 Difference]: Start difference. First operand 14116 states and 19027 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:01:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:54,683 INFO L93 Difference]: Finished difference Result 46612 states and 63333 transitions. [2022-10-16 17:01:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:54,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2022-10-16 17:01:54,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:54,819 INFO L225 Difference]: With dead ends: 46612 [2022-10-16 17:01:54,819 INFO L226 Difference]: Without dead ends: 32510 [2022-10-16 17:01:54,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-16 17:01:54,862 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 541 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:54,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 537 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32510 states. [2022-10-16 17:01:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32510 to 27760. [2022-10-16 17:01:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27760 states, 23323 states have (on average 1.3105089396732839) internal successors, (30565), 23826 states have internal predecessors, (30565), 2379 states have call successors, (2379), 1582 states have call predecessors, (2379), 2052 states have return successors, (4447), 2359 states have call predecessors, (4447), 2379 states have call successors, (4447) [2022-10-16 17:01:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27760 states to 27760 states and 37391 transitions. [2022-10-16 17:01:58,711 INFO L78 Accepts]: Start accepts. Automaton has 27760 states and 37391 transitions. Word has length 86 [2022-10-16 17:01:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:58,712 INFO L495 AbstractCegarLoop]: Abstraction has 27760 states and 37391 transitions. [2022-10-16 17:01:58,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:01:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 27760 states and 37391 transitions. [2022-10-16 17:01:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-10-16 17:01:58,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:58,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:58,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 17:01:58,718 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash 687210699, now seen corresponding path program 1 times [2022-10-16 17:01:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:58,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313646229] [2022-10-16 17:01:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:58,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:58,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:01:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 17:01:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:58,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313646229] [2022-10-16 17:01:58,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313646229] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:58,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:58,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:01:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111997338] [2022-10-16 17:01:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:58,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:01:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:01:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:01:58,781 INFO L87 Difference]: Start difference. First operand 27760 states and 37391 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:02:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:03,063 INFO L93 Difference]: Finished difference Result 58036 states and 78781 transitions. [2022-10-16 17:02:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:02:03,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 86 [2022-10-16 17:02:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:03,274 INFO L225 Difference]: With dead ends: 58036 [2022-10-16 17:02:03,274 INFO L226 Difference]: Without dead ends: 30290 [2022-10-16 17:02:03,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:02:03,319 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 362 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:02:03,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 329 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:02:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30290 states. [2022-10-16 17:02:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30290 to 25918. [2022-10-16 17:02:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25918 states, 21776 states have (on average 1.31704628949302) internal successors, (28680), 22248 states have internal predecessors, (28680), 2216 states have call successors, (2216), 1464 states have call predecessors, (2216), 1920 states have return successors, (4255), 2209 states have call predecessors, (4255), 2216 states have call successors, (4255) [2022-10-16 17:02:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25918 states to 25918 states and 35151 transitions. [2022-10-16 17:02:07,367 INFO L78 Accepts]: Start accepts. Automaton has 25918 states and 35151 transitions. Word has length 86 [2022-10-16 17:02:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:07,367 INFO L495 AbstractCegarLoop]: Abstraction has 25918 states and 35151 transitions. [2022-10-16 17:02:07,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:02:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 25918 states and 35151 transitions. [2022-10-16 17:02:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 17:02:07,370 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:07,371 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:02:07,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 17:02:07,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:02:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1390274218, now seen corresponding path program 1 times [2022-10-16 17:02:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:07,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441480441] [2022-10-16 17:02:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:07,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:07,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:07,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-16 17:02:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 17:02:07,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:07,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441480441] [2022-10-16 17:02:07,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441480441] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:07,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:07,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:02:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014629487] [2022-10-16 17:02:07,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:07,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:02:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:07,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:02:07,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:02:07,485 INFO L87 Difference]: Start difference. First operand 25918 states and 35151 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:02:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:15,772 INFO L93 Difference]: Finished difference Result 83341 states and 114720 transitions. [2022-10-16 17:02:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:02:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2022-10-16 17:02:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:15,971 INFO L225 Difference]: With dead ends: 83341 [2022-10-16 17:02:15,971 INFO L226 Difference]: Without dead ends: 57437 [2022-10-16 17:02:16,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:02:16,022 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 932 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 17:02:16,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 750 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 17:02:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57437 states. [2022-10-16 17:02:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57437 to 52505. [2022-10-16 17:02:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52505 states, 44110 states have (on average 1.2984130582634323) internal successors, (57273), 45229 states have internal predecessors, (57273), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4090 states have return successors, (10441), 4397 states have call predecessors, (10441), 4299 states have call successors, (10441) [2022-10-16 17:02:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52505 states to 52505 states and 72013 transitions. [2022-10-16 17:02:24,197 INFO L78 Accepts]: Start accepts. Automaton has 52505 states and 72013 transitions. Word has length 87 [2022-10-16 17:02:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:24,198 INFO L495 AbstractCegarLoop]: Abstraction has 52505 states and 72013 transitions. [2022-10-16 17:02:24,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:02:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 52505 states and 72013 transitions. [2022-10-16 17:02:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 17:02:24,202 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:24,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:02:24,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 17:02:24,203 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:02:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1475053337, now seen corresponding path program 1 times [2022-10-16 17:02:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:24,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740514121] [2022-10-16 17:02:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:24,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:02:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 17:02:24,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:24,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740514121] [2022-10-16 17:02:24,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740514121] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:24,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:24,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:02:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73558797] [2022-10-16 17:02:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:24,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:02:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:24,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:02:24,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:02:24,318 INFO L87 Difference]: Start difference. First operand 52505 states and 72013 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:02:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:32,910 INFO L93 Difference]: Finished difference Result 104022 states and 142212 transitions. [2022-10-16 17:02:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:02:32,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2022-10-16 17:02:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:33,109 INFO L225 Difference]: With dead ends: 104022 [2022-10-16 17:02:33,109 INFO L226 Difference]: Without dead ends: 60507 [2022-10-16 17:02:33,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-16 17:02:33,189 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 549 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:02:33,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 560 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:02:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60507 states. [2022-10-16 17:02:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60507 to 52769. [2022-10-16 17:02:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52769 states, 44242 states have (on average 1.2899281225984358) internal successors, (57069), 45451 states have internal predecessors, (57069), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4222 states have return successors, (9302), 4439 states have call predecessors, (9302), 4299 states have call successors, (9302) [2022-10-16 17:02:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52769 states to 52769 states and 70670 transitions. [2022-10-16 17:02:41,085 INFO L78 Accepts]: Start accepts. Automaton has 52769 states and 70670 transitions. Word has length 87 [2022-10-16 17:02:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:41,086 INFO L495 AbstractCegarLoop]: Abstraction has 52769 states and 70670 transitions. [2022-10-16 17:02:41,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:02:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 52769 states and 70670 transitions. [2022-10-16 17:02:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 17:02:41,090 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:41,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:02:41,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 17:02:41,091 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:02:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1234813591, now seen corresponding path program 1 times [2022-10-16 17:02:41,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:41,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299037570] [2022-10-16 17:02:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:41,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:02:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 17:02:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:41,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299037570] [2022-10-16 17:02:41,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299037570] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:41,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:41,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:02:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975266167] [2022-10-16 17:02:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:41,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:02:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:02:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:02:41,146 INFO L87 Difference]: Start difference. First operand 52769 states and 70670 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:02:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:48,394 INFO L93 Difference]: Finished difference Result 58684 states and 79014 transitions. [2022-10-16 17:02:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:02:48,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 87 [2022-10-16 17:02:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:48,547 INFO L225 Difference]: With dead ends: 58684 [2022-10-16 17:02:48,547 INFO L226 Difference]: Without dead ends: 49848 [2022-10-16 17:02:48,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:02:48,577 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 362 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 17:02:48,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 327 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 17:02:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49848 states. [2022-10-16 17:02:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49848 to 43937. [2022-10-16 17:02:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43937 states, 36893 states have (on average 1.2947713658417586) internal successors, (47768), 37930 states have internal predecessors, (47768), 3509 states have call successors, (3509), 2352 states have call predecessors, (3509), 3529 states have return successors, (7826), 3658 states have call predecessors, (7826), 3509 states have call successors, (7826) [2022-10-16 17:02:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43937 states to 43937 states and 59103 transitions. [2022-10-16 17:02:55,411 INFO L78 Accepts]: Start accepts. Automaton has 43937 states and 59103 transitions. Word has length 87 [2022-10-16 17:02:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:55,411 INFO L495 AbstractCegarLoop]: Abstraction has 43937 states and 59103 transitions. [2022-10-16 17:02:55,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 17:02:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 43937 states and 59103 transitions. [2022-10-16 17:02:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-10-16 17:02:55,415 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:55,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:02:55,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 17:02:55,415 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:02:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash -47309187, now seen corresponding path program 1 times [2022-10-16 17:02:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:55,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48280598] [2022-10-16 17:02:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:55,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-16 17:02:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 17:02:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:55,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48280598] [2022-10-16 17:02:55,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48280598] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:55,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:55,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:02:55,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034348871] [2022-10-16 17:02:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:55,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:02:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:02:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:02:55,516 INFO L87 Difference]: Start difference. First operand 43937 states and 59103 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:03:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:03:04,048 INFO L93 Difference]: Finished difference Result 90886 states and 123009 transitions. [2022-10-16 17:03:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:03:04,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 89 [2022-10-16 17:03:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:03:04,218 INFO L225 Difference]: With dead ends: 90886 [2022-10-16 17:03:04,218 INFO L226 Difference]: Without dead ends: 50162 [2022-10-16 17:03:04,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:03:04,295 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 883 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 17:03:04,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 853 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 17:03:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50162 states. [2022-10-16 17:03:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50162 to 39179. [2022-10-16 17:03:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39179 states, 32943 states have (on average 1.2890750690586772) internal successors, (42466), 33888 states have internal predecessors, (42466), 3069 states have call successors, (3069), 2060 states have call predecessors, (3069), 3161 states have return successors, (6714), 3234 states have call predecessors, (6714), 3069 states have call successors, (6714) [2022-10-16 17:03:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39179 states to 39179 states and 52249 transitions. [2022-10-16 17:03:10,568 INFO L78 Accepts]: Start accepts. Automaton has 39179 states and 52249 transitions. Word has length 89 [2022-10-16 17:03:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:03:10,569 INFO L495 AbstractCegarLoop]: Abstraction has 39179 states and 52249 transitions. [2022-10-16 17:03:10,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:03:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 39179 states and 52249 transitions. [2022-10-16 17:03:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-16 17:03:10,573 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:03:10,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:03:10,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 17:03:10,574 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:03:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:03:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -23581593, now seen corresponding path program 1 times [2022-10-16 17:03:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:03:10,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787772010] [2022-10-16 17:03:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:03:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:03:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:03:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:03:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:03:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:03:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:03:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 17:03:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:03:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 17:03:10,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:03:10,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787772010] [2022-10-16 17:03:10,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787772010] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:03:10,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:03:10,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:03:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773266954] [2022-10-16 17:03:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:03:10,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:03:10,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:03:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:03:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:03:10,668 INFO L87 Difference]: Start difference. First operand 39179 states and 52249 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 17:03:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:03:19,678 INFO L93 Difference]: Finished difference Result 92880 states and 125239 transitions. [2022-10-16 17:03:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:03:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2022-10-16 17:03:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:03:19,869 INFO L225 Difference]: With dead ends: 92880 [2022-10-16 17:03:19,869 INFO L226 Difference]: Without dead ends: 56888 [2022-10-16 17:03:19,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 17:03:19,943 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 459 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:03:19,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 437 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:03:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56888 states. [2022-10-16 17:03:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56888 to 49789. [2022-10-16 17:03:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49789 states, 41889 states have (on average 1.2872114397574543) internal successors, (53920), 43028 states have internal predecessors, (53920), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (8312), 4120 states have call predecessors, (8312), 3949 states have call successors, (8312) [2022-10-16 17:03:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49789 states to 49789 states and 66181 transitions. [2022-10-16 17:03:27,849 INFO L78 Accepts]: Start accepts. Automaton has 49789 states and 66181 transitions. Word has length 99 [2022-10-16 17:03:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:03:27,850 INFO L495 AbstractCegarLoop]: Abstraction has 49789 states and 66181 transitions. [2022-10-16 17:03:27,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 17:03:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 49789 states and 66181 transitions. [2022-10-16 17:03:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-10-16 17:03:27,856 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:03:27,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:03:27,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 17:03:27,857 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:03:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:03:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1286351433, now seen corresponding path program 1 times [2022-10-16 17:03:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:03:27,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925814833] [2022-10-16 17:03:27,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:03:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:03:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:03:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:03:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:03:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:03:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:03:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 17:03:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:03:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 17:03:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 17:03:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:03:27,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925814833] [2022-10-16 17:03:27,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925814833] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:03:27,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:03:27,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:03:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948140448] [2022-10-16 17:03:27,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:03:27,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:03:27,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:03:27,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:03:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:03:27,985 INFO L87 Difference]: Start difference. First operand 49789 states and 66181 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 17:03:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:03:37,283 INFO L93 Difference]: Finished difference Result 94908 states and 127539 transitions. [2022-10-16 17:03:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 17:03:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 110 [2022-10-16 17:03:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:03:37,471 INFO L225 Difference]: With dead ends: 94908 [2022-10-16 17:03:37,471 INFO L226 Difference]: Without dead ends: 55628 [2022-10-16 17:03:37,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-10-16 17:03:37,565 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1491 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 17:03:37,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 864 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 17:03:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55628 states. [2022-10-16 17:03:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55628 to 49789. [2022-10-16 17:03:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49789 states, 41889 states have (on average 1.2785218076344624) internal successors, (53556), 43028 states have internal predecessors, (53556), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (7766), 4120 states have call predecessors, (7766), 3949 states have call successors, (7766) [2022-10-16 17:03:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49789 states to 49789 states and 65271 transitions. [2022-10-16 17:03:45,490 INFO L78 Accepts]: Start accepts. Automaton has 49789 states and 65271 transitions. Word has length 110 [2022-10-16 17:03:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:03:45,491 INFO L495 AbstractCegarLoop]: Abstraction has 49789 states and 65271 transitions. [2022-10-16 17:03:45,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 17:03:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 49789 states and 65271 transitions. [2022-10-16 17:03:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-16 17:03:45,496 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:03:45,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:03:45,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-16 17:03:45,496 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:03:45,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:03:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash -495718868, now seen corresponding path program 1 times [2022-10-16 17:03:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:03:45,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024162731] [2022-10-16 17:03:45,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:03:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:03:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:03:45,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 17:03:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:03:45,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 17:03:45,574 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 17:03:45,575 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-10-16 17:03:45,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-10-16 17:03:45,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-10-16 17:03:45,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-10-16 17:03:45,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-10-16 17:03:45,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-10-16 17:03:45,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-16 17:03:45,582 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:03:45,587 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 17:03:45,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:03:45 BoogieIcfgContainer [2022-10-16 17:03:45,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 17:03:45,703 INFO L158 Benchmark]: Toolchain (without parser) took 154678.74ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 132.8MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-10-16 17:03:45,704 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 17:03:45,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.27ms. Allocated memory is still 159.4MB. Free memory was 132.8MB in the beginning and 119.5MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 17:03:45,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.10ms. Allocated memory is still 159.4MB. Free memory was 119.5MB in the beginning and 117.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:03:45,704 INFO L158 Benchmark]: Boogie Preprocessor took 82.48ms. Allocated memory is still 159.4MB. Free memory was 117.1MB in the beginning and 115.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:03:45,705 INFO L158 Benchmark]: RCFGBuilder took 861.11ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 131.6MB in the end (delta: -16.3MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2022-10-16 17:03:45,705 INFO L158 Benchmark]: TraceAbstraction took 153242.50ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 130.6MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-10-16 17:03:45,707 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 395.27ms. Allocated memory is still 159.4MB. Free memory was 132.8MB in the beginning and 119.5MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.10ms. Allocated memory is still 159.4MB. Free memory was 119.5MB in the beginning and 117.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 82.48ms. Allocated memory is still 159.4MB. Free memory was 117.1MB in the beginning and 115.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 861.11ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 131.6MB in the end (delta: -16.3MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * TraceAbstraction took 153242.50ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 130.6MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 125]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L376] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L381] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L414] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L61] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L467] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L188] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L190] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=2147483647] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L209] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=1, token=2147483647] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L226] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L228] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=1, tmp___1=0, token=2147483647] [L467] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L125] token += 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 153.1s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 85.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13956 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13676 mSDsluCounter, 17154 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11336 mSDsCounter, 2817 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14321 IncrementalHoareTripleChecker+Invalid, 17138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2817 mSolverCounterUnsat, 5818 mSDtfsCounter, 14321 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52769occurred in iteration=21, InterpolantAutomatonStates: 317, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 67754 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1980 NumberOfCodeBlocks, 1980 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1839 ConstructedInterpolants, 0 QuantifiedInterpolants, 4455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 140/140 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-16 17:03:45,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...