/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.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:00:19,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:00:19,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:00:19,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:00:19,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:00:19,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:00:19,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:00:19,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:00:19,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:00:19,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:00:19,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:00:19,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:00:19,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:00:19,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:00:19,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:00:19,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:00:19,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:00:19,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:00:19,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:00:19,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:00:19,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:00:19,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:00:19,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:00:19,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:00:19,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:00:19,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:00:19,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:00:20,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:00:20,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:00:20,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:00:20,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:00:20,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:00:20,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:00:20,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:00:20,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:00:20,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:00:20,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:00:20,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:00:20,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:00:20,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:00:20,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:00:20,014 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:00:20,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:00:20,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:00:20,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:00:20,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:00:20,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:00:20,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:00:20,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:00:20,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:00:20,086 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:00:20,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:00:20,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:00:20,088 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:00:20,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:00:20,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:00:20,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:00:20,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:00:20,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:00:20,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:00:20,089 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:00:20,089 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:00:20,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:00:20,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:00:20,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:00:20,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:00:20,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:00:20,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:00:20,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:00:20,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:00:20,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:00:20,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:00:20,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:00:20,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:00:20,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:00:20,092 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:00:20,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:00:20,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:00:20,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:00:20,554 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:00:20,554 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:00:20,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-10-16 17:00:20,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8498dd31/5c3077806e514dc0a179edc18565931c/FLAGe6f10ce49 [2022-10-16 17:00:21,298 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:00:21,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-10-16 17:00:21,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8498dd31/5c3077806e514dc0a179edc18565931c/FLAGe6f10ce49 [2022-10-16 17:00:21,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8498dd31/5c3077806e514dc0a179edc18565931c [2022-10-16 17:00:21,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:00:21,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:00:21,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:00:21,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:00:21,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:00:21,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:00:21" (1/1) ... [2022-10-16 17:00:21,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b06805f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:21, skipping insertion in model container [2022-10-16 17:00:21,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:00:21" (1/1) ... [2022-10-16 17:00:21,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:00:21,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:00:21,951 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.01.cil-1.c[671,684] [2022-10-16 17:00:22,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:00:22,018 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:00:22,032 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.01.cil-1.c[671,684] [2022-10-16 17:00:22,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:00:22,119 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:00:22,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22 WrapperNode [2022-10-16 17:00:22,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:00:22,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:00:22,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:00:22,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:00:22,134 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:00:22" (1/1) ... [2022-10-16 17:00:22,144 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:00:22" (1/1) ... [2022-10-16 17:00:22,175 INFO L138 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 219 [2022-10-16 17:00:22,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:00:22,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:00:22,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:00:22,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:00:22,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,221 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:00:22,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:00:22,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:00:22,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:00:22,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (1/1) ... [2022-10-16 17:00:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:00:22,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:22,290 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:00:22,312 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:00:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 17:00:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-16 17:00:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-16 17:00:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-16 17:00:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-16 17:00:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-16 17:00:22,365 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-16 17:00:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-16 17:00:22,368 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-16 17:00:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-16 17:00:22,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-16 17:00:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 17:00:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-16 17:00:22,368 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-16 17:00:22,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:00:22,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:00:22,484 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:00:22,486 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:00:22,899 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:00:22,919 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:00:22,919 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-16 17:00:22,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:00:22 BoogieIcfgContainer [2022-10-16 17:00:22,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:00:22,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:00:22,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:00:22,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:00:22,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:00:21" (1/3) ... [2022-10-16 17:00:22,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2bde45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:00:22, skipping insertion in model container [2022-10-16 17:00:22,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:22" (2/3) ... [2022-10-16 17:00:22,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2bde45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:00:22, skipping insertion in model container [2022-10-16 17:00:22,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:00:22" (3/3) ... [2022-10-16 17:00:22,937 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-10-16 17:00:22,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:00:22,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 17:00:23,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:00:23,050 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;@1b7712e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:00:23,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 17:00:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-10-16 17:00:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:23,068 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:23,069 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] [2022-10-16 17:00:23,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1696984144, now seen corresponding path program 1 times [2022-10-16 17:00:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:23,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663978573] [2022-10-16 17:00:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,668 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:00:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:23,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663978573] [2022-10-16 17:00:23,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663978573] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:23,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:23,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575831919] [2022-10-16 17:00:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:23,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:23,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:23,732 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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:00:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:24,591 INFO L93 Difference]: Finished difference Result 357 states and 529 transitions. [2022-10-16 17:00:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:00:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 55 [2022-10-16 17:00:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:24,610 INFO L225 Difference]: With dead ends: 357 [2022-10-16 17:00:24,610 INFO L226 Difference]: Without dead ends: 243 [2022-10-16 17:00:24,615 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:00:24,620 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 299 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:24,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 478 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:00:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-10-16 17:00:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 200. [2022-10-16 17:00:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 158 states have (on average 1.4556962025316456) internal successors, (230), 163 states have internal predecessors, (230), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-10-16 17:00:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2022-10-16 17:00:24,717 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 55 [2022-10-16 17:00:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:24,718 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2022-10-16 17:00:24,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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:00:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2022-10-16 17:00:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:24,722 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:24,722 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] [2022-10-16 17:00:24,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:00:24,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 767450028, now seen corresponding path program 1 times [2022-10-16 17:00:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:24,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810525723] [2022-10-16 17:00:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:25,046 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:00:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:25,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810525723] [2022-10-16 17:00:25,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810525723] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:25,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:25,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583068724] [2022-10-16 17:00:25,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:25,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:25,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:25,051 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:00:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:25,788 INFO L93 Difference]: Finished difference Result 545 states and 773 transitions. [2022-10-16 17:00:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:00:25,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2022-10-16 17:00:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:25,802 INFO L225 Difference]: With dead ends: 545 [2022-10-16 17:00:25,802 INFO L226 Difference]: Without dead ends: 354 [2022-10-16 17:00:25,807 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:00:25,811 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 279 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:25,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 740 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:00:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-10-16 17:00:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 288. [2022-10-16 17:00:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 229 states have (on average 1.445414847161572) internal successors, (331), 235 states have internal predecessors, (331), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-10-16 17:00:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2022-10-16 17:00:25,876 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 55 [2022-10-16 17:00:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:25,877 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2022-10-16 17:00:25,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:00:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2022-10-16 17:00:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:25,880 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:25,880 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] [2022-10-16 17:00:25,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:00:25,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash -129943250, now seen corresponding path program 1 times [2022-10-16 17:00:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:25,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227339191] [2022-10-16 17:00:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:25,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:25,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:26,112 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:00:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:26,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227339191] [2022-10-16 17:00:26,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227339191] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:26,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:26,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833833675] [2022-10-16 17:00:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:26,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:26,119 INFO L87 Difference]: Start difference. First operand 288 states and 406 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:00:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:26,773 INFO L93 Difference]: Finished difference Result 890 states and 1258 transitions. [2022-10-16 17:00:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:00:26,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2022-10-16 17:00:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:26,779 INFO L225 Difference]: With dead ends: 890 [2022-10-16 17:00:26,779 INFO L226 Difference]: Without dead ends: 611 [2022-10-16 17:00:26,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:00:26,783 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 333 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:26,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 722 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:00:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-10-16 17:00:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 457. [2022-10-16 17:00:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.4316939890710383) internal successors, (524), 374 states have internal predecessors, (524), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-10-16 17:00:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 643 transitions. [2022-10-16 17:00:26,880 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 643 transitions. Word has length 55 [2022-10-16 17:00:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:26,881 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 643 transitions. [2022-10-16 17:00:26,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:00:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 643 transitions. [2022-10-16 17:00:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:26,893 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:26,893 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] [2022-10-16 17:00:26,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 17:00:26,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash 118203244, now seen corresponding path program 1 times [2022-10-16 17:00:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:26,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074146856] [2022-10-16 17:00:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,118 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:00:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:27,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074146856] [2022-10-16 17:00:27,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074146856] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:27,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:27,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:27,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048507082] [2022-10-16 17:00:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:27,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:27,123 INFO L87 Difference]: Start difference. First operand 457 states and 643 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:00:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:27,795 INFO L93 Difference]: Finished difference Result 1424 states and 2007 transitions. [2022-10-16 17:00:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:00:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2022-10-16 17:00:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:27,803 INFO L225 Difference]: With dead ends: 1424 [2022-10-16 17:00:27,804 INFO L226 Difference]: Without dead ends: 976 [2022-10-16 17:00:27,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:00:27,808 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 276 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:27,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 705 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:00:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-10-16 17:00:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 758. [2022-10-16 17:00:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 609 states have (on average 1.4220032840722496) internal successors, (866), 621 states have internal predecessors, (866), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-10-16 17:00:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1071 transitions. [2022-10-16 17:00:27,916 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1071 transitions. Word has length 55 [2022-10-16 17:00:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:27,917 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1071 transitions. [2022-10-16 17:00:27,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:00:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1071 transitions. [2022-10-16 17:00:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:27,919 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:27,920 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] [2022-10-16 17:00:27,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 17:00:27,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:27,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash 541849966, now seen corresponding path program 1 times [2022-10-16 17:00:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:27,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193784168] [2022-10-16 17:00:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:27,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,013 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:00:28,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193784168] [2022-10-16 17:00:28,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193784168] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:28,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:28,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:28,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984160470] [2022-10-16 17:00:28,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:28,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:28,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:28,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:28,016 INFO L87 Difference]: Start difference. First operand 758 states and 1071 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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:00:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:28,596 INFO L93 Difference]: Finished difference Result 2117 states and 3003 transitions. [2022-10-16 17:00:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:00:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 55 [2022-10-16 17:00:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:28,606 INFO L225 Difference]: With dead ends: 2117 [2022-10-16 17:00:28,607 INFO L226 Difference]: Without dead ends: 1369 [2022-10-16 17:00:28,610 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:00:28,612 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 391 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:28,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 569 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:00:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-10-16 17:00:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1162. [2022-10-16 17:00:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 930 states have (on average 1.3989247311827957) internal successors, (1301), 951 states have internal predecessors, (1301), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-10-16 17:00:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1614 transitions. [2022-10-16 17:00:28,781 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1614 transitions. Word has length 55 [2022-10-16 17:00:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:28,781 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1614 transitions. [2022-10-16 17:00:28,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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:00:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1614 transitions. [2022-10-16 17:00:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:28,785 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:28,785 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] [2022-10-16 17:00:28,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 17:00:28,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2042576822, now seen corresponding path program 1 times [2022-10-16 17:00:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:28,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774697732] [2022-10-16 17:00:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:28,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:00:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:28,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774697732] [2022-10-16 17:00:28,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774697732] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:28,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:28,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:28,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38808901] [2022-10-16 17:00:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:28,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:28,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:28,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:28,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:28,957 INFO L87 Difference]: Start difference. First operand 1162 states and 1614 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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:00:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:29,467 INFO L93 Difference]: Finished difference Result 2531 states and 3569 transitions. [2022-10-16 17:00:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 17:00:29,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2022-10-16 17:00:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:29,497 INFO L225 Difference]: With dead ends: 2531 [2022-10-16 17:00:29,497 INFO L226 Difference]: Without dead ends: 1379 [2022-10-16 17:00:29,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-10-16 17:00:29,501 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 166 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:29,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 507 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-10-16 17:00:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1177. [2022-10-16 17:00:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 945 states have (on average 1.3830687830687831) internal successors, (1307), 966 states have internal predecessors, (1307), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-10-16 17:00:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1620 transitions. [2022-10-16 17:00:29,652 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1620 transitions. Word has length 56 [2022-10-16 17:00:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:29,652 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1620 transitions. [2022-10-16 17:00:29,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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:00:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1620 transitions. [2022-10-16 17:00:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:29,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:29,655 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] [2022-10-16 17:00:29,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 17:00:29,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2114963380, now seen corresponding path program 1 times [2022-10-16 17:00:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:29,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303883809] [2022-10-16 17:00:29,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:29,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:29,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:29,798 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:00:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:29,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303883809] [2022-10-16 17:00:29,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303883809] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:29,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:29,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459644613] [2022-10-16 17:00:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:29,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:29,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:29,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:29,801 INFO L87 Difference]: Start difference. First operand 1177 states and 1620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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:00:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:30,339 INFO L93 Difference]: Finished difference Result 2586 states and 3614 transitions. [2022-10-16 17:00:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 17:00:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2022-10-16 17:00:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:30,350 INFO L225 Difference]: With dead ends: 2586 [2022-10-16 17:00:30,350 INFO L226 Difference]: Without dead ends: 1419 [2022-10-16 17:00:30,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-10-16 17:00:30,355 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 131 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:30,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 500 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-10-16 17:00:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1219. [2022-10-16 17:00:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 987 states have (on average 1.3667679837892603) internal successors, (1349), 1008 states have internal predecessors, (1349), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-10-16 17:00:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1662 transitions. [2022-10-16 17:00:30,478 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1662 transitions. Word has length 56 [2022-10-16 17:00:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:30,479 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1662 transitions. [2022-10-16 17:00:30,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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:00:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1662 transitions. [2022-10-16 17:00:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:30,481 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:30,481 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] [2022-10-16 17:00:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 17:00:30,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -191735346, now seen corresponding path program 1 times [2022-10-16 17:00:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:30,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109412228] [2022-10-16 17:00:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:30,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:30,627 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:00:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109412228] [2022-10-16 17:00:30,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109412228] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:30,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:30,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:00:30,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747082118] [2022-10-16 17:00:30,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:30,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:00:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:30,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:00:30,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:00:30,630 INFO L87 Difference]: Start difference. First operand 1219 states and 1662 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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:00:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:31,208 INFO L93 Difference]: Finished difference Result 1767 states and 2410 transitions. [2022-10-16 17:00:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 17:00:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2022-10-16 17:00:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:31,216 INFO L225 Difference]: With dead ends: 1767 [2022-10-16 17:00:31,217 INFO L226 Difference]: Without dead ends: 1048 [2022-10-16 17:00:31,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-10-16 17:00:31,221 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 437 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:31,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 498 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-10-16 17:00:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 878. [2022-10-16 17:00:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 709 states have (on average 1.3540197461212975) internal successors, (960), 723 states have internal predecessors, (960), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2022-10-16 17:00:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1175 transitions. [2022-10-16 17:00:31,308 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1175 transitions. Word has length 56 [2022-10-16 17:00:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:31,308 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1175 transitions. [2022-10-16 17:00:31,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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:00:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1175 transitions. [2022-10-16 17:00:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:31,310 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:31,310 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] [2022-10-16 17:00:31,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 17:00:31,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:31,311 INFO L85 PathProgramCache]: Analyzing trace with hash 27119372, now seen corresponding path program 1 times [2022-10-16 17:00:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:31,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812806470] [2022-10-16 17:00:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:31,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,456 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:00:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:31,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812806470] [2022-10-16 17:00:31,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812806470] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:31,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:31,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:00:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888595980] [2022-10-16 17:00:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:31,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:00:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:00:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:00:31,459 INFO L87 Difference]: Start difference. First operand 878 states and 1175 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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:00:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:32,109 INFO L93 Difference]: Finished difference Result 1710 states and 2296 transitions. [2022-10-16 17:00:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:00:32,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2022-10-16 17:00:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:32,117 INFO L225 Difference]: With dead ends: 1710 [2022-10-16 17:00:32,117 INFO L226 Difference]: Without dead ends: 1076 [2022-10-16 17:00:32,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-10-16 17:00:32,121 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 415 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:32,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 504 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:00:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-10-16 17:00:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 872. [2022-10-16 17:00:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.348936170212766) internal successors, (951), 717 states have internal predecessors, (951), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2022-10-16 17:00:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1158 transitions. [2022-10-16 17:00:32,209 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1158 transitions. Word has length 56 [2022-10-16 17:00:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:32,209 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1158 transitions. [2022-10-16 17:00:32,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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:00:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1158 transitions. [2022-10-16 17:00:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:32,211 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:32,211 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] [2022-10-16 17:00:32,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 17:00:32,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash 449821198, now seen corresponding path program 1 times [2022-10-16 17:00:32,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:32,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268413529] [2022-10-16 17:00:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:32,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,344 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:00:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:32,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268413529] [2022-10-16 17:00:32,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268413529] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:32,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:32,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:00:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437733420] [2022-10-16 17:00:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:32,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:00:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:32,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:00:32,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:00:32,346 INFO L87 Difference]: Start difference. First operand 872 states and 1158 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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:00:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:32,929 INFO L93 Difference]: Finished difference Result 1649 states and 2185 transitions. [2022-10-16 17:00:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 17:00:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2022-10-16 17:00:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:32,936 INFO L225 Difference]: With dead ends: 1649 [2022-10-16 17:00:32,936 INFO L226 Difference]: Without dead ends: 932 [2022-10-16 17:00:32,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-10-16 17:00:32,940 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 306 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:32,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 589 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:00:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-10-16 17:00:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 760. [2022-10-16 17:00:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 618 states have (on average 1.343042071197411) internal successors, (830), 628 states have internal predecessors, (830), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2022-10-16 17:00:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1002 transitions. [2022-10-16 17:00:33,022 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1002 transitions. Word has length 56 [2022-10-16 17:00:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:33,022 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1002 transitions. [2022-10-16 17:00:33,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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:00:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1002 transitions. [2022-10-16 17:00:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:33,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:33,024 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] [2022-10-16 17:00:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 17:00:33,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -367827252, now seen corresponding path program 1 times [2022-10-16 17:00:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:33,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366919218] [2022-10-16 17:00:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,112 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:00:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366919218] [2022-10-16 17:00:33,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366919218] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:33,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:33,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844698677] [2022-10-16 17:00:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:33,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:33,115 INFO L87 Difference]: Start difference. First operand 760 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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:00:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:33,581 INFO L93 Difference]: Finished difference Result 2370 states and 3182 transitions. [2022-10-16 17:00:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:00:33,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 56 [2022-10-16 17:00:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:33,593 INFO L225 Difference]: With dead ends: 2370 [2022-10-16 17:00:33,593 INFO L226 Difference]: Without dead ends: 1621 [2022-10-16 17:00:33,596 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:00:33,597 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 378 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:33,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 331 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-10-16 17:00:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1447. [2022-10-16 17:00:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1177 states have (on average 1.3271028037383177) internal successors, (1562), 1194 states have internal predecessors, (1562), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2022-10-16 17:00:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1921 transitions. [2022-10-16 17:00:33,757 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1921 transitions. Word has length 56 [2022-10-16 17:00:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:33,757 INFO L495 AbstractCegarLoop]: Abstraction has 1447 states and 1921 transitions. [2022-10-16 17:00:33,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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:00:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1921 transitions. [2022-10-16 17:00:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 17:00:33,758 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:33,759 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] [2022-10-16 17:00:33,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 17:00:33,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1034084368, now seen corresponding path program 1 times [2022-10-16 17:00:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:33,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470411277] [2022-10-16 17:00:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:33,821 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:00:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:33,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470411277] [2022-10-16 17:00:33,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470411277] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:33,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:33,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:00:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743255283] [2022-10-16 17:00:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:33,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:00:33,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:00:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:00:33,824 INFO L87 Difference]: Start difference. First operand 1447 states and 1921 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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:00:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:34,342 INFO L93 Difference]: Finished difference Result 4136 states and 5521 transitions. [2022-10-16 17:00:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:00:34,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 57 [2022-10-16 17:00:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:34,362 INFO L225 Difference]: With dead ends: 4136 [2022-10-16 17:00:34,362 INFO L226 Difference]: Without dead ends: 2703 [2022-10-16 17:00:34,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 17:00:34,370 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 303 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:34,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 376 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 17:00:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2022-10-16 17:00:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2357. [2022-10-16 17:00:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1913 states have (on average 1.311552535284893) internal successors, (2509), 1940 states have internal predecessors, (2509), 258 states have call successors, (258), 164 states have call predecessors, (258), 182 states have return successors, (330), 254 states have call predecessors, (330), 258 states have call successors, (330) [2022-10-16 17:00:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3097 transitions. [2022-10-16 17:00:34,675 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3097 transitions. Word has length 57 [2022-10-16 17:00:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:34,676 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3097 transitions. [2022-10-16 17:00:34,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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:00:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3097 transitions. [2022-10-16 17:00:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 17:00:34,678 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:34,678 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] [2022-10-16 17:00:34,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 17:00:34,678 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash -286197174, now seen corresponding path program 1 times [2022-10-16 17:00:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:34,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839734276] [2022-10-16 17:00:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:34,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:34,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:34,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 17:00:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:34,777 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:00:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:34,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839734276] [2022-10-16 17:00:34,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839734276] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:34,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:34,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4149966] [2022-10-16 17:00:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:34,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:34,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:34,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:34,780 INFO L87 Difference]: Start difference. First operand 2357 states and 3097 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:00:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:35,937 INFO L93 Difference]: Finished difference Result 7472 states and 9914 transitions. [2022-10-16 17:00:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:00:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 74 [2022-10-16 17:00:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:35,979 INFO L225 Difference]: With dead ends: 7472 [2022-10-16 17:00:35,979 INFO L226 Difference]: Without dead ends: 5131 [2022-10-16 17:00:35,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:00:35,995 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 671 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:35,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 531 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:00:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2022-10-16 17:00:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4605. [2022-10-16 17:00:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 3722 states have (on average 1.2888232133261688) internal successors, (4797), 3791 states have internal predecessors, (4797), 496 states have call successors, (496), 321 states have call predecessors, (496), 383 states have return successors, (778), 496 states have call predecessors, (778), 496 states have call successors, (778) [2022-10-16 17:00:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6071 transitions. [2022-10-16 17:00:36,590 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6071 transitions. Word has length 74 [2022-10-16 17:00:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:36,592 INFO L495 AbstractCegarLoop]: Abstraction has 4605 states and 6071 transitions. [2022-10-16 17:00:36,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:00:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6071 transitions. [2022-10-16 17:00:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 17:00:36,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:36,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:36,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 17:00:36,597 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1327486831, now seen corresponding path program 1 times [2022-10-16 17:00:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:36,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668873476] [2022-10-16 17:00:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 17:00:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:00:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 17:00:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-16 17:00:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:36,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668873476] [2022-10-16 17:00:36,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668873476] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:36,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:36,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080186274] [2022-10-16 17:00:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:36,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:36,870 INFO L87 Difference]: Start difference. First operand 4605 states and 6071 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 17:00:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:37,687 INFO L93 Difference]: Finished difference Result 8872 states and 11640 transitions. [2022-10-16 17:00:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:00:37,687 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), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-10-16 17:00:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:37,722 INFO L225 Difference]: With dead ends: 8872 [2022-10-16 17:00:37,722 INFO L226 Difference]: Without dead ends: 5201 [2022-10-16 17:00:37,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-10-16 17:00:37,736 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 521 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:37,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 342 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-10-16 17:00:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4573. [2022-10-16 17:00:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3686 states have (on average 1.2769940314704287) internal successors, (4707), 3759 states have internal predecessors, (4707), 496 states have call successors, (496), 321 states have call predecessors, (496), 387 states have return successors, (697), 496 states have call predecessors, (697), 496 states have call successors, (697) [2022-10-16 17:00:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5900 transitions. [2022-10-16 17:00:38,318 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5900 transitions. Word has length 90 [2022-10-16 17:00:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:38,318 INFO L495 AbstractCegarLoop]: Abstraction has 4573 states and 5900 transitions. [2022-10-16 17:00:38,318 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), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 17:00:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5900 transitions. [2022-10-16 17:00:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 17:00:38,321 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:38,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:38,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 17:00:38,322 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1400722515, now seen corresponding path program 1 times [2022-10-16 17:00:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:38,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892580210] [2022-10-16 17:00:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 17:00:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:00:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 17:00:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 17:00:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:38,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892580210] [2022-10-16 17:00:38,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892580210] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:38,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:38,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:00:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127528512] [2022-10-16 17:00:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:38,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:00:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:00:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:00:38,389 INFO L87 Difference]: Start difference. First operand 4573 states and 5900 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 17:00:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:39,041 INFO L93 Difference]: Finished difference Result 5037 states and 6517 transitions. [2022-10-16 17:00:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:00:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-10-16 17:00:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:39,068 INFO L225 Difference]: With dead ends: 5037 [2022-10-16 17:00:39,068 INFO L226 Difference]: Without dead ends: 4141 [2022-10-16 17:00:39,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 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:00:39,074 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 249 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:39,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 236 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:00:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2022-10-16 17:00:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3679. [2022-10-16 17:00:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.281965006729475) internal successors, (3810), 3033 states have internal predecessors, (3810), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (562), 393 states have call predecessors, (562), 390 states have call successors, (562) [2022-10-16 17:00:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4762 transitions. [2022-10-16 17:00:39,535 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4762 transitions. Word has length 90 [2022-10-16 17:00:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:39,536 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4762 transitions. [2022-10-16 17:00:39,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 17:00:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4762 transitions. [2022-10-16 17:00:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 17:00:39,538 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:39,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:39,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 17:00:39,539 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1500452604, now seen corresponding path program 1 times [2022-10-16 17:00:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:39,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657740788] [2022-10-16 17:00:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:39,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 17:00:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:00:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 17:00:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-16 17:00:39,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:39,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657740788] [2022-10-16 17:00:39,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657740788] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:39,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:39,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:39,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690432520] [2022-10-16 17:00:39,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:39,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:39,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:39,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:39,658 INFO L87 Difference]: Start difference. First operand 3679 states and 4762 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:00:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:40,846 INFO L93 Difference]: Finished difference Result 7051 states and 9090 transitions. [2022-10-16 17:00:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 17:00:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 91 [2022-10-16 17:00:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:40,868 INFO L225 Difference]: With dead ends: 7051 [2022-10-16 17:00:40,868 INFO L226 Difference]: Without dead ends: 4058 [2022-10-16 17:00:40,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-10-16 17:00:40,878 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 980 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:40,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 619 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 17:00:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-10-16 17:00:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3679. [2022-10-16 17:00:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.2671601615074024) internal successors, (3766), 3033 states have internal predecessors, (3766), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-10-16 17:00:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4652 transitions. [2022-10-16 17:00:41,369 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4652 transitions. Word has length 91 [2022-10-16 17:00:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:41,369 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4652 transitions. [2022-10-16 17:00:41,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:00:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4652 transitions. [2022-10-16 17:00:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 17:00:41,372 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:41,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:41,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 17:00:41,373 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:00:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash -78861023, now seen corresponding path program 1 times [2022-10-16 17:00:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:41,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519372470] [2022-10-16 17:00:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:00:41,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 17:00:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:00:41,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 17:00:41,445 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 17:00:41,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-10-16 17:00:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-10-16 17:00:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-10-16 17:00:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-10-16 17:00:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 17:00:41,453 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:41,458 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 17:00:41,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:00:41 BoogieIcfgContainer [2022-10-16 17:00:41,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 17:00:41,617 INFO L158 Benchmark]: Toolchain (without parser) took 19984.35ms. Allocated memory was 158.3MB in the beginning and 750.8MB in the end (delta: 592.4MB). Free memory was 132.2MB in the beginning and 646.5MB in the end (delta: -514.4MB). Peak memory consumption was 78.3MB. Max. memory is 8.0GB. [2022-10-16 17:00:41,620 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 158.3MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 17:00:41,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.56ms. Allocated memory is still 158.3MB. Free memory was 132.0MB in the beginning and 119.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 17:00:41,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.49ms. Allocated memory is still 158.3MB. Free memory was 119.6MB in the beginning and 117.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:00:41,622 INFO L158 Benchmark]: Boogie Preprocessor took 55.01ms. Allocated memory is still 158.3MB. Free memory was 117.5MB in the beginning and 116.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 17:00:41,623 INFO L158 Benchmark]: RCFGBuilder took 687.67ms. Allocated memory is still 158.3MB. Free memory was 116.0MB in the beginning and 136.0MB in the end (delta: -20.0MB). Peak memory consumption was 19.4MB. Max. memory is 8.0GB. [2022-10-16 17:00:41,624 INFO L158 Benchmark]: TraceAbstraction took 18688.05ms. Allocated memory was 158.3MB in the beginning and 750.8MB in the end (delta: 592.4MB). Free memory was 135.0MB in the beginning and 646.5MB in the end (delta: -511.6MB). Peak memory consumption was 80.9MB. Max. memory is 8.0GB. [2022-10-16 17:00:41,626 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 158.3MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 471.56ms. Allocated memory is still 158.3MB. Free memory was 132.0MB in the beginning and 119.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.49ms. Allocated memory is still 158.3MB. Free memory was 119.6MB in the beginning and 117.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.01ms. Allocated memory is still 158.3MB. Free memory was 117.5MB in the beginning and 116.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 687.67ms. Allocated memory is still 158.3MB. Free memory was 116.0MB in the beginning and 136.0MB in the end (delta: -20.0MB). Peak memory consumption was 19.4MB. Max. memory is 8.0GB. * TraceAbstraction took 18688.05ms. Allocated memory was 158.3MB in the beginning and 750.8MB in the end (delta: 592.4MB). Free memory was 135.0MB in the beginning and 646.5MB in the end (delta: -511.6MB). Peak memory consumption was 80.9MB. 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: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=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, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=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, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=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, token=0] [L421] FCALL update_channels() VAL [E_1=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, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=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, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=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, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L259] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L264] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L269] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L274] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L423] RET fire_delta_events() VAL [E_1=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, token=0] [L424] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L134] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=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, token=0] [L136] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=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, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, tmp=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L153] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=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, token=0] [L155] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=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, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, tmp=0, tmp___0=0, token=0] [L424] RET activate_threads() VAL [E_1=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, token=0] [L425] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L287] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L292] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L297] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L302] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L425] RET reset_delta_events() VAL [E_1=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, token=0] [L428] COND TRUE 1 VAL [E_1=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, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=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, token=0] [L210] COND TRUE 1 VAL [E_1=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, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=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, token=0] [L185] int __retres1 ; VAL [E_1=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, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=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, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=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, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=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, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=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, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=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, tmp=1, tmp_ndt_1=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=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, token=0] [L99] COND TRUE 1 VAL [E_1=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, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=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, token=0] [L240] RET transmit1() [L210] COND TRUE 1 VAL [E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=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, token=0] [L185] int __retres1 ; VAL [E_1=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, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=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, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=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, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=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, token=0] [L55] COND TRUE 1 VAL [E_1=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, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, 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, token=2147483647] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L341] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L134] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, 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, token=2147483647] [L136] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, 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, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, tmp=0, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, 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, token=2147483647] [L155] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, 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, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, tmp=0, tmp___0=1, token=2147483647] [L341] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, 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, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=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, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=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, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=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, token=2147483647] [L107] token += 1 VAL [E_1=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, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: 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, 113 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6285 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6135 mSDsluCounter, 8247 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5455 mSDsCounter, 1675 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7064 IncrementalHoareTripleChecker+Invalid, 8739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1675 mSolverCounterUnsat, 2792 mSDtfsCounter, 7064 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4605occurred in iteration=13, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 4151 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 92/92 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:00:41,692 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...