/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:01:01,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:01:01,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:01:01,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:01:01,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:01:01,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:01:01,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:01:01,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:01:01,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:01:01,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:01:01,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:01:01,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:01:01,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:01:01,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:01:01,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:01:01,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:01:01,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:01:01,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:01:01,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:01:01,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:01:01,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:01:01,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:01:01,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:01:01,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:01:01,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:01:01,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:01:01,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:01:01,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:01:01,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:01:01,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:01:01,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:01:01,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:01:01,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:01:01,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:01:01,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:01:01,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:01:01,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:01:01,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:01:01,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:01:01,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:01:01,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:01:01,535 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:01,591 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:01:01,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:01:01,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:01:01,592 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:01:01,594 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:01:01,594 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:01:01,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:01:01,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:01:01,598 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:01:01,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:01:01,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:01:01,599 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:01:01,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:01:01,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:01:01,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:01:01,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:01:01,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:01:01,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:01:01,601 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:01:01,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:01:01,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:01:01,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:01:01,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:01:01,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:01:01,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:01:01,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:01:01,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:01:01,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:01:01,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:01:01,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:01:01,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:01:01,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:01:01,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:01:01,604 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:02,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:01:02,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:01:02,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:01:02,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:01:02,074 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:01:02,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-10-16 17:01:02,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e833ed111/23ee8141abbc4c51aa342145936a0be2/FLAGb27ae4303 [2022-10-16 17:01:02,862 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:01:02,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-10-16 17:01:02,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e833ed111/23ee8141abbc4c51aa342145936a0be2/FLAGb27ae4303 [2022-10-16 17:01:03,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e833ed111/23ee8141abbc4c51aa342145936a0be2 [2022-10-16 17:01:03,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:01:03,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:01:03,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:01:03,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:01:03,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:01:03,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:03" (1/1) ... [2022-10-16 17:01:03,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edf3ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:03, skipping insertion in model container [2022-10-16 17:01:03,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:03" (1/1) ... [2022-10-16 17:01:03,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:01:03,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:01:03,455 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-1.c[671,684] [2022-10-16 17:01:03,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:01:03,543 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:01:03,557 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-1.c[671,684] [2022-10-16 17:01:03,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:01:03,649 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:01:03,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:03 WrapperNode [2022-10-16 17:01:03,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:01:03,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:01:03,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:01:03,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:01:03,662 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:03" (1/1) ... [2022-10-16 17:01:03,692 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:03" (1/1) ... [2022-10-16 17:01:03,759 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 279 [2022-10-16 17:01:03,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:01:03,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:01:03,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:01:03,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:01:03,776 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:03" (1/1) ... [2022-10-16 17:01:03,777 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:03" (1/1) ... [2022-10-16 17:01:03,796 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:03" (1/1) ... [2022-10-16 17:01:03,796 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:03" (1/1) ... [2022-10-16 17:01:03,810 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:03" (1/1) ... [2022-10-16 17:01:03,832 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:03" (1/1) ... [2022-10-16 17:01:03,837 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:03" (1/1) ... [2022-10-16 17:01:03,842 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:03" (1/1) ... [2022-10-16 17:01:03,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:01:03,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:01:03,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:01:03,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:01:03,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:03" (1/1) ... [2022-10-16 17:01:03,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:01:03,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:01:03,887 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:03,916 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:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 17:01:03,979 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-16 17:01:03,980 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-16 17:01:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-16 17:01:03,980 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-16 17:01:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-16 17:01:03,980 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-16 17:01:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-16 17:01:03,983 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-16 17:01:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-16 17:01:03,983 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-16 17:01:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 17:01:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-16 17:01:03,984 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-16 17:01:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:01:03,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:01:04,117 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:01:04,119 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:01:04,769 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:01:04,785 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:01:04,786 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-16 17:01:04,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:04 BoogieIcfgContainer [2022-10-16 17:01:04,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:01:04,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:01:04,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:01:04,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:01:04,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:01:03" (1/3) ... [2022-10-16 17:01:04,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38086bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:04, skipping insertion in model container [2022-10-16 17:01:04,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:03" (2/3) ... [2022-10-16 17:01:04,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38086bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:04, skipping insertion in model container [2022-10-16 17:01:04,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:04" (3/3) ... [2022-10-16 17:01:04,801 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2022-10-16 17:01:04,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:01:04,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-16 17:01:04,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:01:04,925 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;@74d6c924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:01:04,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-16 17:01:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 112 states have (on average 1.5892857142857142) internal successors, (178), 119 states have internal predecessors, (178), 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:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:04,945 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:04,946 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:04,947 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:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -371961680, now seen corresponding path program 1 times [2022-10-16 17:01:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:04,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407406495] [2022-10-16 17:01:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:04,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:05,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:05,360 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:05,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:05,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407406495] [2022-10-16 17:01:05,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407406495] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:05,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:05,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:01:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446620656] [2022-10-16 17:01:05,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:05,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:01:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:01:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:01:05,420 INFO L87 Difference]: Start difference. First operand has 141 states, 112 states have (on average 1.5892857142857142) internal successors, (178), 119 states have internal predecessors, (178), 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) 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:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:05,960 INFO L93 Difference]: Finished difference Result 307 states and 466 transitions. [2022-10-16 17:01:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:01:05,963 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:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:05,978 INFO L225 Difference]: With dead ends: 307 [2022-10-16 17:01:05,978 INFO L226 Difference]: Without dead ends: 167 [2022-10-16 17:01:05,984 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:05,988 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 293 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:05,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 364 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-10-16 17:01:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2022-10-16 17:01:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 113 states have internal predecessors, (160), 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:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2022-10-16 17:01:06,070 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 66 [2022-10-16 17:01:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:06,070 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2022-10-16 17:01:06,073 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:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2022-10-16 17:01:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:06,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:06,082 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:06,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:01:06,083 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:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash -932661458, now seen corresponding path program 1 times [2022-10-16 17:01:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:06,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734278229] [2022-10-16 17:01:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,553 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:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734278229] [2022-10-16 17:01:06,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734278229] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:06,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:06,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064682708] [2022-10-16 17:01:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:06,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:06,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:06,559 INFO L87 Difference]: Start difference. First operand 135 states and 192 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:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:07,378 INFO L93 Difference]: Finished difference Result 447 states and 655 transitions. [2022-10-16 17:01:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:07,378 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:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:07,384 INFO L225 Difference]: With dead ends: 447 [2022-10-16 17:01:07,384 INFO L226 Difference]: Without dead ends: 322 [2022-10-16 17:01:07,386 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:07,388 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 411 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 562 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:07,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 562 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:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-10-16 17:01:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 255. [2022-10-16 17:01:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 209 states have (on average 1.507177033492823) internal successors, (315), 216 states have internal predecessors, (315), 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:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 372 transitions. [2022-10-16 17:01:07,461 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 372 transitions. Word has length 66 [2022-10-16 17:01:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:07,462 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 372 transitions. [2022-10-16 17:01:07,462 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:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 372 transitions. [2022-10-16 17:01:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:07,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:07,465 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:07,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:01:07,466 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:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash -190655958, now seen corresponding path program 1 times [2022-10-16 17:01:07,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:07,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268076809] [2022-10-16 17:01:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:07,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:07,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:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:07,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268076809] [2022-10-16 17:01:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268076809] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:07,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:07,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488219973] [2022-10-16 17:01:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:07,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:07,682 INFO L87 Difference]: Start difference. First operand 255 states and 372 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:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:08,591 INFO L93 Difference]: Finished difference Result 718 states and 1057 transitions. [2022-10-16 17:01:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:01:08,592 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:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:08,601 INFO L225 Difference]: With dead ends: 718 [2022-10-16 17:01:08,601 INFO L226 Difference]: Without dead ends: 473 [2022-10-16 17:01:08,607 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:08,617 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 401 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 967 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:08,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 967 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:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-10-16 17:01:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 368. [2022-10-16 17:01:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 304 states have (on average 1.5) internal successors, (456), 312 states have internal predecessors, (456), 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:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 537 transitions. [2022-10-16 17:01:08,694 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 537 transitions. Word has length 66 [2022-10-16 17:01:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:08,694 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 537 transitions. [2022-10-16 17:01:08,694 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:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 537 transitions. [2022-10-16 17:01:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:08,696 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:08,697 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:08,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 17:01:08,697 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:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash 253244716, now seen corresponding path program 1 times [2022-10-16 17:01:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:08,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068748547] [2022-10-16 17:01:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:08,856 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:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068748547] [2022-10-16 17:01:08,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068748547] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:08,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:08,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874934582] [2022-10-16 17:01:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:08,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:08,860 INFO L87 Difference]: Start difference. First operand 368 states and 537 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:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:09,689 INFO L93 Difference]: Finished difference Result 1116 states and 1648 transitions. [2022-10-16 17:01:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:01:09,690 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:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:09,696 INFO L225 Difference]: With dead ends: 1116 [2022-10-16 17:01:09,696 INFO L226 Difference]: Without dead ends: 758 [2022-10-16 17:01:09,698 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:09,700 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 433 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 672 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:09,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 672 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:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-10-16 17:01:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 595. [2022-10-16 17:01:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 495 states have (on average 1.492929292929293) internal successors, (739), 505 states have internal predecessors, (739), 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:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 872 transitions. [2022-10-16 17:01:09,777 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 872 transitions. Word has length 66 [2022-10-16 17:01:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:09,778 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 872 transitions. [2022-10-16 17:01:09,778 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:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 872 transitions. [2022-10-16 17:01:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:09,780 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:09,780 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:09,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 17:01:09,781 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:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:09,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1791584746, now seen corresponding path program 1 times [2022-10-16 17:01:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:09,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678475637] [2022-10-16 17:01:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:09,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:09,933 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:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:09,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678475637] [2022-10-16 17:01:09,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678475637] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:09,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:09,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:09,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469756922] [2022-10-16 17:01:09,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:09,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:09,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:09,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:09,937 INFO L87 Difference]: Start difference. First operand 595 states and 872 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:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:10,964 INFO L93 Difference]: Finished difference Result 1984 states and 2933 transitions. [2022-10-16 17:01:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:01:10,965 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:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:10,975 INFO L225 Difference]: With dead ends: 1984 [2022-10-16 17:01:10,975 INFO L226 Difference]: Without dead ends: 1399 [2022-10-16 17:01:10,978 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:10,979 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 407 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 965 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:10,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 965 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:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-10-16 17:01:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1015. [2022-10-16 17:01:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 847 states have (on average 1.4911452184179457) internal successors, (1263), 861 states have internal predecessors, (1263), 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:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1498 transitions. [2022-10-16 17:01:11,116 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1498 transitions. Word has length 66 [2022-10-16 17:01:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:11,116 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1498 transitions. [2022-10-16 17:01:11,116 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:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1498 transitions. [2022-10-16 17:01:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:11,119 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:11,119 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:11,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 17:01:11,120 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:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1310504488, now seen corresponding path program 1 times [2022-10-16 17:01:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:11,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152304856] [2022-10-16 17:01:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,253 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:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:11,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152304856] [2022-10-16 17:01:11,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152304856] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:11,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:11,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920528127] [2022-10-16 17:01:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:11,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:11,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:11,256 INFO L87 Difference]: Start difference. First operand 1015 states and 1498 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:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:12,255 INFO L93 Difference]: Finished difference Result 3406 states and 5045 transitions. [2022-10-16 17:01:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:01:12,258 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:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:12,291 INFO L225 Difference]: With dead ends: 3406 [2022-10-16 17:01:12,291 INFO L226 Difference]: Without dead ends: 2401 [2022-10-16 17:01:12,302 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:12,303 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 412 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 937 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:12,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 937 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:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2022-10-16 17:01:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1868. [2022-10-16 17:01:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1568 states have (on average 1.4853316326530612) internal successors, (2329), 1590 states have internal predecessors, (2329), 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:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2778 transitions. [2022-10-16 17:01:12,578 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2778 transitions. Word has length 66 [2022-10-16 17:01:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:12,579 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2778 transitions. [2022-10-16 17:01:12,579 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:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2778 transitions. [2022-10-16 17:01:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 17:01:12,582 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:12,583 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,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 17:01:12,583 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:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1294985770, now seen corresponding path program 1 times [2022-10-16 17:01:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792822190] [2022-10-16 17:01:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,684 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:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:12,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792822190] [2022-10-16 17:01:12,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792822190] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:12,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:12,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051395899] [2022-10-16 17:01:12,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:12,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:12,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:12,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:12,687 INFO L87 Difference]: Start difference. First operand 1868 states and 2778 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:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:13,713 INFO L93 Difference]: Finished difference Result 5271 states and 7867 transitions. [2022-10-16 17:01:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:13,713 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:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:13,736 INFO L225 Difference]: With dead ends: 5271 [2022-10-16 17:01:13,737 INFO L226 Difference]: Without dead ends: 3414 [2022-10-16 17:01:13,745 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:13,746 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 541 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 763 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.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:13,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 763 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2022-10-16 17:01:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2823. [2022-10-16 17:01:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2365 states have (on average 1.46892177589852) internal successors, (3474), 2404 states have internal predecessors, (3474), 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:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4143 transitions. [2022-10-16 17:01:14,050 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4143 transitions. Word has length 66 [2022-10-16 17:01:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:14,050 INFO L495 AbstractCegarLoop]: Abstraction has 2823 states and 4143 transitions. [2022-10-16 17:01:14,051 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:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4143 transitions. [2022-10-16 17:01:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:14,053 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:14,054 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:14,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 17:01:14,054 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:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2126026312, now seen corresponding path program 1 times [2022-10-16 17:01:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:14,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601339514] [2022-10-16 17:01:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:14,203 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,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:14,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601339514] [2022-10-16 17:01:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601339514] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:14,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103356786] [2022-10-16 17:01:14,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:14,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:14,206 INFO L87 Difference]: Start difference. First operand 2823 states and 4143 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:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:15,293 INFO L93 Difference]: Finished difference Result 6427 states and 9540 transitions. [2022-10-16 17:01:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 17:01:15,294 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:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:15,327 INFO L225 Difference]: With dead ends: 6427 [2022-10-16 17:01:15,327 INFO L226 Difference]: Without dead ends: 3615 [2022-10-16 17:01:15,340 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:15,343 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 262 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 649 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:15,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 649 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:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2022-10-16 17:01:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2850. [2022-10-16 17:01:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2392 states have (on average 1.4565217391304348) internal successors, (3484), 2431 states have internal predecessors, (3484), 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:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 4153 transitions. [2022-10-16 17:01:15,781 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 4153 transitions. Word has length 67 [2022-10-16 17:01:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:15,784 INFO L495 AbstractCegarLoop]: Abstraction has 2850 states and 4153 transitions. [2022-10-16 17:01:15,784 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:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 4153 transitions. [2022-10-16 17:01:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:15,786 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:15,787 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:15,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 17:01:15,787 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:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1745294262, now seen corresponding path program 1 times [2022-10-16 17:01:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:15,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795814465] [2022-10-16 17:01:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:15,953 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,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795814465] [2022-10-16 17:01:15,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795814465] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:15,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:15,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958859496] [2022-10-16 17:01:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:15,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:15,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:15,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:15,957 INFO L87 Difference]: Start difference. First operand 2850 states and 4153 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:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:17,017 INFO L93 Difference]: Finished difference Result 6717 states and 9903 transitions. [2022-10-16 17:01:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 17:01:17,017 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:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:17,060 INFO L225 Difference]: With dead ends: 6717 [2022-10-16 17:01:17,063 INFO L226 Difference]: Without dead ends: 3878 [2022-10-16 17:01:17,075 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:17,078 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 262 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 641 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:17,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 641 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:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-10-16 17:01:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 2928. [2022-10-16 17:01:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2470 states have (on average 1.4421052631578948) internal successors, (3562), 2509 states have internal predecessors, (3562), 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:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 4231 transitions. [2022-10-16 17:01:17,497 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 4231 transitions. Word has length 67 [2022-10-16 17:01:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:17,498 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 4231 transitions. [2022-10-16 17:01:17,498 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:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 4231 transitions. [2022-10-16 17:01:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:17,530 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:17,530 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:17,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 17:01:17,531 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:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1705667532, now seen corresponding path program 1 times [2022-10-16 17:01:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:17,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878894357] [2022-10-16 17:01:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:17,706 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,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878894357] [2022-10-16 17:01:17,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878894357] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:17,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:17,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368385882] [2022-10-16 17:01:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:17,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:17,709 INFO L87 Difference]: Start difference. First operand 2928 states and 4231 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:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:20,073 INFO L93 Difference]: Finished difference Result 10541 states and 15513 transitions. [2022-10-16 17:01:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:20,074 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:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:20,129 INFO L225 Difference]: With dead ends: 10541 [2022-10-16 17:01:20,130 INFO L226 Difference]: Without dead ends: 7624 [2022-10-16 17:01:20,145 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:20,146 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 929 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:20,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 836 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 17:01:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7624 states. [2022-10-16 17:01:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7624 to 6518. [2022-10-16 17:01:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6518 states, 5488 states have (on average 1.430393586005831) internal successors, (7850), 5586 states have internal predecessors, (7850), 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:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6518 states to 6518 states and 9442 transitions. [2022-10-16 17:01:21,168 INFO L78 Accepts]: Start accepts. Automaton has 6518 states and 9442 transitions. Word has length 67 [2022-10-16 17:01:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:21,168 INFO L495 AbstractCegarLoop]: Abstraction has 6518 states and 9442 transitions. [2022-10-16 17:01:21,168 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:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6518 states and 9442 transitions. [2022-10-16 17:01:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:21,173 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:21,173 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,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 17:01:21,174 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:21,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash 129109773, now seen corresponding path program 1 times [2022-10-16 17:01:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:21,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130062917] [2022-10-16 17:01:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:21,329 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,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:21,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130062917] [2022-10-16 17:01:21,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130062917] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:21,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:21,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483636225] [2022-10-16 17:01:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:21,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:21,333 INFO L87 Difference]: Start difference. First operand 6518 states and 9442 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,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:22,900 INFO L93 Difference]: Finished difference Result 14437 states and 21460 transitions. [2022-10-16 17:01:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 17:01:22,901 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,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:22,975 INFO L225 Difference]: With dead ends: 14437 [2022-10-16 17:01:22,975 INFO L226 Difference]: Without dead ends: 7930 [2022-10-16 17:01:23,000 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:23,002 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 179 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 634 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:23,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 634 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:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7930 states. [2022-10-16 17:01:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7930 to 6623. [2022-10-16 17:01:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 5593 states have (on average 1.4176649383157518) internal successors, (7929), 5691 states have internal predecessors, (7929), 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:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 9521 transitions. [2022-10-16 17:01:24,095 INFO L78 Accepts]: Start accepts. Automaton has 6623 states and 9521 transitions. Word has length 67 [2022-10-16 17:01:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:24,096 INFO L495 AbstractCegarLoop]: Abstraction has 6623 states and 9521 transitions. [2022-10-16 17:01:24,097 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,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6623 states and 9521 transitions. [2022-10-16 17:01:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:24,100 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:24,100 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,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 17:01:24,101 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:24,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1515313167, now seen corresponding path program 1 times [2022-10-16 17:01:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:24,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801234267] [2022-10-16 17:01:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:24,276 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:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:24,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801234267] [2022-10-16 17:01:24,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801234267] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:24,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:24,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579359209] [2022-10-16 17:01:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:24,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:24,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:24,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:24,278 INFO L87 Difference]: Start difference. First operand 6623 states and 9521 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:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:25,828 INFO L93 Difference]: Finished difference Result 8700 states and 12585 transitions. [2022-10-16 17:01:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 17:01:25,828 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:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:25,856 INFO L225 Difference]: With dead ends: 8700 [2022-10-16 17:01:25,856 INFO L226 Difference]: Without dead ends: 5018 [2022-10-16 17:01:25,873 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:25,874 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 663 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 641 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.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:25,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 641 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:01:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2022-10-16 17:01:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 4098. [2022-10-16 17:01:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 3451 states have (on average 1.4001738626485076) internal successors, (4832), 3509 states have internal predecessors, (4832), 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:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5775 transitions. [2022-10-16 17:01:26,581 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5775 transitions. Word has length 67 [2022-10-16 17:01:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:26,582 INFO L495 AbstractCegarLoop]: Abstraction has 4098 states and 5775 transitions. [2022-10-16 17:01:26,582 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:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5775 transitions. [2022-10-16 17:01:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:26,583 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:26,583 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:26,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 17:01:26,584 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:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1381299661, now seen corresponding path program 1 times [2022-10-16 17:01:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:26,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369611363] [2022-10-16 17:01:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:26,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:26,750 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:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369611363] [2022-10-16 17:01:26,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369611363] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:26,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:26,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245914038] [2022-10-16 17:01:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:26,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:26,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:26,753 INFO L87 Difference]: Start difference. First operand 4098 states and 5775 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:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:28,604 INFO L93 Difference]: Finished difference Result 12716 states and 18070 transitions. [2022-10-16 17:01:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:28,605 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:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:28,639 INFO L225 Difference]: With dead ends: 12716 [2022-10-16 17:01:28,639 INFO L226 Difference]: Without dead ends: 8630 [2022-10-16 17:01:28,655 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:28,656 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 550 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 737 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:28,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 737 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:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8630 states. [2022-10-16 17:01:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8630 to 7038. [2022-10-16 17:01:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 5920 states have (on average 1.383614864864865) internal successors, (8191), 6045 states have internal predecessors, (8191), 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:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 9828 transitions. [2022-10-16 17:01:29,623 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 9828 transitions. Word has length 67 [2022-10-16 17:01:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:29,624 INFO L495 AbstractCegarLoop]: Abstraction has 7038 states and 9828 transitions. [2022-10-16 17:01:29,624 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:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 9828 transitions. [2022-10-16 17:01:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:29,627 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:29,627 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:29,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 17:01:29,627 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:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1600154379, now seen corresponding path program 1 times [2022-10-16 17:01:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768109588] [2022-10-16 17:01:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:29,785 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:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:29,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768109588] [2022-10-16 17:01:29,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768109588] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:29,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:29,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047375811] [2022-10-16 17:01:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:29,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:29,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:29,787 INFO L87 Difference]: Start difference. First operand 7038 states and 9828 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:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:31,503 INFO L93 Difference]: Finished difference Result 13044 states and 18132 transitions. [2022-10-16 17:01:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:31,504 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:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:31,536 INFO L225 Difference]: With dead ends: 13044 [2022-10-16 17:01:31,536 INFO L226 Difference]: Without dead ends: 7554 [2022-10-16 17:01:31,558 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:31,559 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 481 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 723 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.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:31,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 723 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:01:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7554 states. [2022-10-16 17:01:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7554 to 5882. [2022-10-16 17:01:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5882 states, 4976 states have (on average 1.3587218649517685) internal successors, (6761), 5077 states have internal predecessors, (6761), 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:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5882 states to 5882 states and 8054 transitions. [2022-10-16 17:01:32,514 INFO L78 Accepts]: Start accepts. Automaton has 5882 states and 8054 transitions. Word has length 67 [2022-10-16 17:01:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:32,514 INFO L495 AbstractCegarLoop]: Abstraction has 5882 states and 8054 transitions. [2022-10-16 17:01:32,514 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,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5882 states and 8054 transitions. [2022-10-16 17:01:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:32,516 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:32,516 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,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 17:01:32,517 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:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:32,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2022856205, now seen corresponding path program 1 times [2022-10-16 17:01:32,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:32,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207924605] [2022-10-16 17:01:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:32,674 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:32,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:32,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207924605] [2022-10-16 17:01:32,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207924605] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:32,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:32,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:01:32,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974186709] [2022-10-16 17:01:32,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:32,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:01:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:32,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:01:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:01:32,677 INFO L87 Difference]: Start difference. First operand 5882 states and 8054 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,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:34,272 INFO L93 Difference]: Finished difference Result 11056 states and 15233 transitions. [2022-10-16 17:01:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:34,273 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,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:34,306 INFO L225 Difference]: With dead ends: 11056 [2022-10-16 17:01:34,307 INFO L226 Difference]: Without dead ends: 7496 [2022-10-16 17:01:34,320 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:34,321 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 515 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:34,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 704 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:01:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7496 states. [2022-10-16 17:01:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7496 to 5849. [2022-10-16 17:01:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5849 states, 4953 states have (on average 1.352109832424793) internal successors, (6697), 5044 states have internal predecessors, (6697), 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:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 7946 transitions. [2022-10-16 17:01:35,115 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 7946 transitions. Word has length 67 [2022-10-16 17:01:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:35,116 INFO L495 AbstractCegarLoop]: Abstraction has 5849 states and 7946 transitions. [2022-10-16 17:01:35,116 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:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 7946 transitions. [2022-10-16 17:01:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:01:35,118 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:35,118 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:35,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 17:01:35,118 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:35,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1205207755, now seen corresponding path program 1 times [2022-10-16 17:01:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:35,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467159837] [2022-10-16 17:01:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:35,224 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:35,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:35,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467159837] [2022-10-16 17:01:35,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467159837] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:35,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:35,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152587743] [2022-10-16 17:01:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:35,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:35,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:35,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:35,227 INFO L87 Difference]: Start difference. First operand 5849 states and 7946 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:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:37,446 INFO L93 Difference]: Finished difference Result 16695 states and 23064 transitions. [2022-10-16 17:01:37,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:37,446 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:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:37,492 INFO L225 Difference]: With dead ends: 16695 [2022-10-16 17:01:37,493 INFO L226 Difference]: Without dead ends: 10860 [2022-10-16 17:01:37,508 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:37,509 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 561 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 415 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:37,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 415 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:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2022-10-16 17:01:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 9142. [2022-10-16 17:01:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9142 states, 7750 states have (on average 1.3396129032258064) internal successors, (10382), 7878 states have internal predecessors, (10382), 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:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9142 states to 9142 states and 12436 transitions. [2022-10-16 17:01:38,793 INFO L78 Accepts]: Start accepts. Automaton has 9142 states and 12436 transitions. Word has length 67 [2022-10-16 17:01:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:38,794 INFO L495 AbstractCegarLoop]: Abstraction has 9142 states and 12436 transitions. [2022-10-16 17:01:38,794 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:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9142 states and 12436 transitions. [2022-10-16 17:01:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 17:01:38,795 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:38,796 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:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 17:01:38,796 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:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash 485360651, now seen corresponding path program 1 times [2022-10-16 17:01:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:38,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539833265] [2022-10-16 17:01:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:38,868 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:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:38,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539833265] [2022-10-16 17:01:38,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539833265] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:38,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:38,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:01:38,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647642152] [2022-10-16 17:01:38,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:38,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:01:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:38,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:01:38,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:01:38,871 INFO L87 Difference]: Start difference. First operand 9142 states and 12436 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:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:42,046 INFO L93 Difference]: Finished difference Result 25812 states and 35395 transitions. [2022-10-16 17:01:42,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:01:42,046 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:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:42,123 INFO L225 Difference]: With dead ends: 25812 [2022-10-16 17:01:42,123 INFO L226 Difference]: Without dead ends: 16594 [2022-10-16 17:01:42,154 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:42,155 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 456 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:42,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 402 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16594 states. [2022-10-16 17:01:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16594 to 14036. [2022-10-16 17:01:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 11860 states have (on average 1.3244519392917369) internal successors, (15708), 12058 states have internal predecessors, (15708), 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:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 18883 transitions. [2022-10-16 17:01:44,372 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 18883 transitions. Word has length 68 [2022-10-16 17:01:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:44,373 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 18883 transitions. [2022-10-16 17:01:44,373 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:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 18883 transitions. [2022-10-16 17:01:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-10-16 17:01:44,376 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:44,377 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:44,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 17:01:44,377 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:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1575374325, now seen corresponding path program 1 times [2022-10-16 17:01:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:44,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646892698] [2022-10-16 17:01:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:44,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:01:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:44,487 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:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:44,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646892698] [2022-10-16 17:01:44,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646892698] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:44,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:44,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:01:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210025933] [2022-10-16 17:01:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:44,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:01:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:44,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:01:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:01:44,490 INFO L87 Difference]: Start difference. First operand 14036 states and 18883 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:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:48,773 INFO L93 Difference]: Finished difference Result 46372 states and 62901 transitions. [2022-10-16 17:01:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:48,774 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:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:48,916 INFO L225 Difference]: With dead ends: 46372 [2022-10-16 17:01:48,916 INFO L226 Difference]: Without dead ends: 32350 [2022-10-16 17:01:48,957 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:48,958 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 436 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:48,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 565 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32350 states. [2022-10-16 17:01:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32350 to 27600. [2022-10-16 17:01:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27600 states, 23163 states have (on average 1.307127746837629) internal successors, (30277), 23666 states have internal predecessors, (30277), 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:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27600 states to 27600 states and 37103 transitions. [2022-10-16 17:01:53,065 INFO L78 Accepts]: Start accepts. Automaton has 27600 states and 37103 transitions. Word has length 86 [2022-10-16 17:01:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:53,065 INFO L495 AbstractCegarLoop]: Abstraction has 27600 states and 37103 transitions. [2022-10-16 17:01:53,065 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:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 27600 states and 37103 transitions. [2022-10-16 17:01:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-10-16 17:01:53,070 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:53,070 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:53,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 17:01:53,071 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:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1602439927, now seen corresponding path program 1 times [2022-10-16 17:01:53,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:53,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579664008] [2022-10-16 17:01:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:53,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:01:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:53,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:01:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:01:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:53,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:01:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:53,132 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:53,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:53,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579664008] [2022-10-16 17:01:53,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579664008] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:53,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:53,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:01:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697826248] [2022-10-16 17:01:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:53,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:01:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:01:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:01:53,135 INFO L87 Difference]: Start difference. First operand 27600 states and 37103 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:01:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:57,256 INFO L93 Difference]: Finished difference Result 57716 states and 78205 transitions. [2022-10-16 17:01:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:01:57,256 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:01:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:57,381 INFO L225 Difference]: With dead ends: 57716 [2022-10-16 17:01:57,382 INFO L226 Difference]: Without dead ends: 30130 [2022-10-16 17:01:57,553 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:01:57,554 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 353 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 302 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.2s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:57,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 302 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 17:01:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30130 states. [2022-10-16 17:02:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30130 to 25758. [2022-10-16 17:02:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25758 states, 21616 states have (on average 1.3134715025906736) internal successors, (28392), 22088 states have internal predecessors, (28392), 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:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25758 states to 25758 states and 34863 transitions. [2022-10-16 17:02:00,881 INFO L78 Accepts]: Start accepts. Automaton has 25758 states and 34863 transitions. Word has length 86 [2022-10-16 17:02:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:00,881 INFO L495 AbstractCegarLoop]: Abstraction has 25758 states and 34863 transitions. [2022-10-16 17:02:00,881 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:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25758 states and 34863 transitions. [2022-10-16 17:02:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 17:02:00,884 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:00,885 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:00,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 17:02:00,885 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1127248928, now seen corresponding path program 1 times [2022-10-16 17:02:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:00,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044087667] [2022-10-16 17:02:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:00,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:00,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:02:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:01,004 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:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:01,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044087667] [2022-10-16 17:02:01,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044087667] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:01,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:01,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:02:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156178534] [2022-10-16 17:02:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:01,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:02:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:02:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:02:01,007 INFO L87 Difference]: Start difference. First operand 25758 states and 34863 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:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:08,689 INFO L93 Difference]: Finished difference Result 83783 states and 114191 transitions. [2022-10-16 17:02:08,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:02:08,690 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:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:08,886 INFO L225 Difference]: With dead ends: 83783 [2022-10-16 17:02:08,886 INFO L226 Difference]: Without dead ends: 58039 [2022-10-16 17:02:08,947 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:08,948 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 441 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:02:08,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 681 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:02:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58039 states. [2022-10-16 17:02:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58039 to 52449. [2022-10-16 17:02:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52449 states, 43922 states have (on average 1.2938618459997269) internal successors, (56829), 45131 states have internal predecessors, (56829), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4222 states have return successors, (9590), 4439 states have call predecessors, (9590), 4299 states have call successors, (9590) [2022-10-16 17:02:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52449 states to 52449 states and 70718 transitions. [2022-10-16 17:02:16,487 INFO L78 Accepts]: Start accepts. Automaton has 52449 states and 70718 transitions. Word has length 87 [2022-10-16 17:02:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:16,488 INFO L495 AbstractCegarLoop]: Abstraction has 52449 states and 70718 transitions. [2022-10-16 17:02:16,488 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:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52449 states and 70718 transitions. [2022-10-16 17:02:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 17:02:16,492 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:16,492 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:16,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 17:02:16,493 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -337808753, now seen corresponding path program 1 times [2022-10-16 17:02:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:16,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316521977] [2022-10-16 17:02:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:16,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-16 17:02:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:16,647 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:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:16,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316521977] [2022-10-16 17:02:16,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316521977] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:16,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:16,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:02:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45698724] [2022-10-16 17:02:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:16,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:02:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:16,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:02:16,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:02:16,653 INFO L87 Difference]: Start difference. First operand 52449 states and 70718 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:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:25,897 INFO L93 Difference]: Finished difference Result 103392 states and 139871 transitions. [2022-10-16 17:02:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:02:25,898 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:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:26,115 INFO L225 Difference]: With dead ends: 103392 [2022-10-16 17:02:26,116 INFO L226 Difference]: Without dead ends: 59729 [2022-10-16 17:02:26,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:02:26,180 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 891 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 17:02:26,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 706 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 17:02:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59729 states. [2022-10-16 17:02:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59729 to 52449. [2022-10-16 17:02:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52449 states, 43922 states have (on average 1.2862119211329175) internal successors, (56493), 45131 states have internal predecessors, (56493), 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:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52449 states to 52449 states and 70094 transitions. [2022-10-16 17:02:33,430 INFO L78 Accepts]: Start accepts. Automaton has 52449 states and 70094 transitions. Word has length 87 [2022-10-16 17:02:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:33,431 INFO L495 AbstractCegarLoop]: Abstraction has 52449 states and 70094 transitions. [2022-10-16 17:02:33,431 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:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 52449 states and 70094 transitions. [2022-10-16 17:02:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 17:02:33,435 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:33,435 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:33,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 17:02:33,435 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:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1367488674, now seen corresponding path program 1 times [2022-10-16 17:02:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:33,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618509067] [2022-10-16 17:02:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:33,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:33,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:02:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:33,495 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:33,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:33,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618509067] [2022-10-16 17:02:33,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618509067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:33,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:33,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:02:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464432150] [2022-10-16 17:02:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:33,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:02:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:02:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:02:33,497 INFO L87 Difference]: Start difference. First operand 52449 states and 70094 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:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:39,909 INFO L93 Difference]: Finished difference Result 58364 states and 78438 transitions. [2022-10-16 17:02:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:02:39,909 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:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:40,031 INFO L225 Difference]: With dead ends: 58364 [2022-10-16 17:02:40,032 INFO L226 Difference]: Without dead ends: 49588 [2022-10-16 17:02:40,054 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:40,055 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 353 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 300 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:40,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 300 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:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49588 states. [2022-10-16 17:02:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49588 to 43677. [2022-10-16 17:02:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43677 states, 36633 states have (on average 1.291185543089564) internal successors, (47300), 37670 states have internal predecessors, (47300), 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:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43677 states to 43677 states and 58635 transitions. [2022-10-16 17:02:46,004 INFO L78 Accepts]: Start accepts. Automaton has 43677 states and 58635 transitions. Word has length 87 [2022-10-16 17:02:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:02:46,005 INFO L495 AbstractCegarLoop]: Abstraction has 43677 states and 58635 transitions. [2022-10-16 17:02:46,005 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:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 43677 states and 58635 transitions. [2022-10-16 17:02:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-10-16 17:02:46,008 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:02:46,008 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:46,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 17:02:46,009 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:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:02:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2054687254, now seen corresponding path program 1 times [2022-10-16 17:02:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:02:46,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416067960] [2022-10-16 17:02:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:02:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:02:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:02:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:46,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:02:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:02:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:02:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:02:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-16 17:02:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:02:46,112 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:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:02:46,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416067960] [2022-10-16 17:02:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416067960] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:02:46,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:02:46,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:02:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188516842] [2022-10-16 17:02:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:02:46,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:02:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:02:46,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:02:46,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:02:46,115 INFO L87 Difference]: Start difference. First operand 43677 states and 58635 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:02:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:02:53,810 INFO L93 Difference]: Finished difference Result 90366 states and 122073 transitions. [2022-10-16 17:02:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:02:53,810 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:02:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:02:54,032 INFO L225 Difference]: With dead ends: 90366 [2022-10-16 17:02:54,032 INFO L226 Difference]: Without dead ends: 49902 [2022-10-16 17:02:54,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:02:54,124 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 854 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 17:02:54,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 774 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 17:02:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49902 states. [2022-10-16 17:03:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49902 to 38919. [2022-10-16 17:03:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38919 states, 32683 states have (on average 1.2850105559465166) internal successors, (41998), 33628 states have internal predecessors, (41998), 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:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38919 states to 38919 states and 51781 transitions. [2022-10-16 17:03:00,422 INFO L78 Accepts]: Start accepts. Automaton has 38919 states and 51781 transitions. Word has length 89 [2022-10-16 17:03:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:03:00,423 INFO L495 AbstractCegarLoop]: Abstraction has 38919 states and 51781 transitions. [2022-10-16 17:03:00,423 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:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 38919 states and 51781 transitions. [2022-10-16 17:03:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-16 17:03:00,427 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:03:00,428 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:00,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 17:03:00,428 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:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:03:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash -817869291, now seen corresponding path program 1 times [2022-10-16 17:03:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:03:00,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585842086] [2022-10-16 17:03:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:03:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:03:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:03:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:03:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:03:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:03:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:03:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 17:03:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:03:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:00,515 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:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:03:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585842086] [2022-10-16 17:03:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585842086] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:03:00,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:03:00,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:03:00,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844195244] [2022-10-16 17:03:00,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:03:00,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:03:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:03:00,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:03:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:03:00,518 INFO L87 Difference]: Start difference. First operand 38919 states and 51781 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:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:03:08,555 INFO L93 Difference]: Finished difference Result 92230 states and 124069 transitions. [2022-10-16 17:03:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:03:08,555 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:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:03:08,722 INFO L225 Difference]: With dead ends: 92230 [2022-10-16 17:03:08,723 INFO L226 Difference]: Without dead ends: 56498 [2022-10-16 17:03:08,939 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:08,940 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 440 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:03:08,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 465 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:03:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56498 states. [2022-10-16 17:03:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56498 to 49399. [2022-10-16 17:03:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49399 states, 41499 states have (on average 1.2823923468035374) internal successors, (53218), 42638 states have internal predecessors, (53218), 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:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49399 states to 49399 states and 65479 transitions. [2022-10-16 17:03:16,080 INFO L78 Accepts]: Start accepts. Automaton has 49399 states and 65479 transitions. Word has length 99 [2022-10-16 17:03:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:03:16,081 INFO L495 AbstractCegarLoop]: Abstraction has 49399 states and 65479 transitions. [2022-10-16 17:03:16,081 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:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 49399 states and 65479 transitions. [2022-10-16 17:03:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-10-16 17:03:16,088 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:03:16,088 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:16,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 17:03:16,089 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:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:03:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1957425714, now seen corresponding path program 1 times [2022-10-16 17:03:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:03:16,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304856211] [2022-10-16 17:03:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:03:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:03:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:03:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:03:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:03:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 17:03:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 17:03:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 17:03:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:03:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 17:03:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:03:16,208 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:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:03:16,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304856211] [2022-10-16 17:03:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304856211] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:03:16,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:03:16,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:03:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781144237] [2022-10-16 17:03:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:03:16,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:03:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:03:16,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:03:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:03:16,211 INFO L87 Difference]: Start difference. First operand 49399 states and 65479 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:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:03:24,717 INFO L93 Difference]: Finished difference Result 94128 states and 126135 transitions. [2022-10-16 17:03:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 17:03:24,717 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:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:03:24,861 INFO L225 Difference]: With dead ends: 94128 [2022-10-16 17:03:24,861 INFO L226 Difference]: Without dead ends: 55238 [2022-10-16 17:03:24,917 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:24,918 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 1460 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 17:03:24,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 822 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 17:03:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55238 states. [2022-10-16 17:03:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55238 to 49399. [2022-10-16 17:03:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49399 states, 41499 states have (on average 1.2736210511096653) internal successors, (52854), 42638 states have internal predecessors, (52854), 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:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49399 states to 49399 states and 64569 transitions. [2022-10-16 17:03:31,761 INFO L78 Accepts]: Start accepts. Automaton has 49399 states and 64569 transitions. Word has length 110 [2022-10-16 17:03:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:03:31,762 INFO L495 AbstractCegarLoop]: Abstraction has 49399 states and 64569 transitions. [2022-10-16 17:03:31,762 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:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 49399 states and 64569 transitions. [2022-10-16 17:03:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-16 17:03:31,769 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:03:31,769 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:31,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-16 17:03:31,770 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:31,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:03:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 304616749, now seen corresponding path program 1 times [2022-10-16 17:03:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:03:31,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5398161] [2022-10-16 17:03:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:03:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:03:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:03:31,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 17:03:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:03:31,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 17:03:31,876 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 17:03:31,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-10-16 17:03:31,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-10-16 17:03:31,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-10-16 17:03:31,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-10-16 17:03:31,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-10-16 17:03:31,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-10-16 17:03:31,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-16 17:03:31,891 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:31,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 17:03:32,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:03:32 BoogieIcfgContainer [2022-10-16 17:03:32,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 17:03:32,050 INFO L158 Benchmark]: Toolchain (without parser) took 148853.48ms. Allocated memory was 151.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 125.5MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-10-16 17:03:32,051 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 17:03:32,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.99ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 111.8MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 17:03:32,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.87ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:03:32,051 INFO L158 Benchmark]: Boogie Preprocessor took 87.64ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:03:32,052 INFO L158 Benchmark]: RCFGBuilder took 940.63ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 120.9MB in the end (delta: -13.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-10-16 17:03:32,052 INFO L158 Benchmark]: TraceAbstraction took 147256.93ms. Allocated memory was 151.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 120.4MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-10-16 17:03:32,054 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.17ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.99ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 111.8MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 106.87ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 87.64ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 940.63ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 120.9MB in the end (delta: -13.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * TraceAbstraction took 147256.93ms. Allocated memory was 151.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 120.4MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.9GB. 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: 113]: 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] [L598] int __retres1 ; [L602] CALL init_model() [L512] m_i = 1 [L513] t1_i = 1 [L514] 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] [L602] RET init_model() [L603] CALL start_simulation() [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] 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] [L546] 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] [L547] CALL init_threads() [L231] COND TRUE m_i == 1 [L232] 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] [L236] COND TRUE t1_i == 1 [L237] 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] [L241] COND TRUE t2_i == 1 [L242] 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] [L547] RET init_threads() [L548] 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] [L344] 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] [L349] 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] [L354] 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] [L359] 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] [L364] 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] [L369] 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] [L548] 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] [L549] 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] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] 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] [L166] 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] [L176] __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] [L178] 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] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] 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] [L431] CALL, EXPR is_transmit1_triggered() [L182] 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] [L185] 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] [L195] __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] [L197] 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] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] 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] [L439] CALL, EXPR is_transmit2_triggered() [L201] 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] [L204] 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] [L214] __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] [L216] 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] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] 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] [L549] 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] [L550] 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] [L382] 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] [L387] 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] [L392] 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] [L397] 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] [L402] 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] [L407] 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] [L550] 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] [L553] 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] [L556] kernel_st = 1 [L557] CALL eval() [L277] 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] [L281] 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] [L284] 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] [L251] 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] [L254] COND TRUE m_st == 0 [L255] __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] [L272] 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] [L284] 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] [L284] tmp = exists_runnable_thread() [L286] 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] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] 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] [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] 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] [L105] 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] [L107] t1_pc = 1 [L108] 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] [L311] RET transmit1() [L319] COND TRUE t2_st == 0 [L320] int tmp_ndt_3; [L321] tmp_ndt_3 = __VERIFIER_nondet_int() [L322] 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] [L281] 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] [L284] 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] [L251] 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] [L254] COND TRUE m_st == 0 [L255] __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] [L272] 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] [L284] 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] [L284] tmp = exists_runnable_thread() [L286] 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] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND TRUE \read(tmp_ndt_1) [L296] m_st = 1 [L297] CALL master() [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, 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, 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, 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] [L455] 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] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] 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] [L166] 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] [L176] __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] [L178] 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] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] 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] [L431] CALL, EXPR is_transmit1_triggered() [L182] 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] [L185] 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] [L186] COND TRUE E_1 == 1 [L187] __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] [L197] 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] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND TRUE \read(tmp___0) [L434] 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] [L439] CALL, EXPR is_transmit2_triggered() [L201] 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] [L204] 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] [L214] __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] [L216] 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] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] 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] [L455] 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, 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, token=2147483647] [L297] RET master() [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] 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] [L97] 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] [L113] 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: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: 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 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 147.0s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 83.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13260 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12984 mSDsluCounter, 16227 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10637 mSDsCounter, 2621 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14638 IncrementalHoareTripleChecker+Invalid, 17259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2621 mSolverCounterUnsat, 5590 mSDtfsCounter, 14638 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.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52449occurred in iteration=20, 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: 59.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 67934 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s 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:32,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...