/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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:00:44,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:00:44,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:00:44,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:00:44,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:00:44,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:00:44,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:00:44,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:00:44,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:00:44,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:00:44,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:00:44,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:00:44,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:00:44,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:00:44,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:00:44,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:00:44,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:00:44,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:00:44,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:00:44,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:00:44,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:00:44,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:00:44,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:00:44,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:00:44,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:00:44,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:00:44,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:00:44,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:00:44,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:00:44,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:00:44,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:00:44,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:00:44,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:00:44,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:00:44,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:00:44,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:00:44,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:00:44,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:00:44,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:00:44,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:00:44,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:00:44,423 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:44,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:00:44,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:00:44,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:00:44,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:00:44,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:00:44,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:00:44,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:00:44,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:00:44,486 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:00:44,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:00:44,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:00:44,488 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:00:44,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:00:44,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:00:44,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:00:44,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:00:44,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:00:44,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:00:44,489 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:00:44,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:00:44,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:00:44,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:00:44,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:00:44,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:00:44,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:00:44,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:00:44,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:00:44,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:00:44,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:00:44,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:00:44,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:00:44,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:00:44,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:00:44,492 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:44,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:00:44,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:00:44,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:00:44,951 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:00:44,952 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:00:44,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-10-16 17:00:45,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159da7cd7/2fd7eb1846a24dca9da673d6ff0d282d/FLAGe734743b3 [2022-10-16 17:00:45,705 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:00:45,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-10-16 17:00:45,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159da7cd7/2fd7eb1846a24dca9da673d6ff0d282d/FLAGe734743b3 [2022-10-16 17:00:46,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159da7cd7/2fd7eb1846a24dca9da673d6ff0d282d [2022-10-16 17:00:46,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:00:46,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:00:46,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:00:46,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:00:46,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:00:46,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:00:46" (1/1) ... [2022-10-16 17:00:46,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f13b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:46, skipping insertion in model container [2022-10-16 17:00:46,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:00:46" (1/1) ... [2022-10-16 17:00:46,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:00:46,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:00:46,264 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-2.c[671,684] [2022-10-16 17:00:46,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:00:46,348 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:00:46,363 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-2.c[671,684] [2022-10-16 17:00:46,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:00:46,406 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:00:46,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:46 WrapperNode [2022-10-16 17:00:46,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:00:46,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:00:46,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:00:46,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:00:46,417 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:46" (1/1) ... [2022-10-16 17:00:46,427 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:46" (1/1) ... [2022-10-16 17:00:46,471 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 224 [2022-10-16 17:00:46,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:00:46,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:00:46,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:00:46,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:00:46,489 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:46" (1/1) ... [2022-10-16 17:00:46,490 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:46" (1/1) ... [2022-10-16 17:00:46,506 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:46" (1/1) ... [2022-10-16 17:00:46,506 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:46" (1/1) ... [2022-10-16 17:00:46,514 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:46" (1/1) ... [2022-10-16 17:00:46,530 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:46" (1/1) ... [2022-10-16 17:00:46,532 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:46" (1/1) ... [2022-10-16 17:00:46,541 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:46" (1/1) ... [2022-10-16 17:00:46,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:00:46,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:00:46,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:00:46,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:00:46,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:46" (1/1) ... [2022-10-16 17:00:46,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:00:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:46,588 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:46,605 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:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 17:00:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-10-16 17:00:46,649 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-10-16 17:00:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-16 17:00:46,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-16 17:00:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-16 17:00:46,649 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-16 17:00:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-16 17:00:46,650 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-16 17:00:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-16 17:00:46,650 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-16 17:00:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-16 17:00:46,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-16 17:00:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 17:00:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-16 17:00:46,651 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-16 17:00:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:00:46,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:00:46,735 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:00:46,738 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:00:47,248 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:00:47,259 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:00:47,259 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-16 17:00:47,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:00:47 BoogieIcfgContainer [2022-10-16 17:00:47,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:00:47,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:00:47,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:00:47,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:00:47,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:00:46" (1/3) ... [2022-10-16 17:00:47,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58913aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:00:47, skipping insertion in model container [2022-10-16 17:00:47,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:00:46" (2/3) ... [2022-10-16 17:00:47,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58913aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:00:47, skipping insertion in model container [2022-10-16 17:00:47,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:00:47" (3/3) ... [2022-10-16 17:00:47,273 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-10-16 17:00:47,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:00:47,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 17:00:47,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:00:47,383 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;@48879801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:00:47,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 17:00:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-10-16 17:00:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:47,424 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:47,425 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:47,426 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:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1554820752, now seen corresponding path program 1 times [2022-10-16 17:00:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:47,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781994607] [2022-10-16 17:00:47,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:48,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:48,088 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:48,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:48,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781994607] [2022-10-16 17:00:48,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781994607] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:48,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:48,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:48,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58169580] [2022-10-16 17:00:48,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:48,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:48,152 INFO L87 Difference]: Start difference. First operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) 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:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:48,994 INFO L93 Difference]: Finished difference Result 379 states and 571 transitions. [2022-10-16 17:00:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:00:48,998 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:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:49,014 INFO L225 Difference]: With dead ends: 379 [2022-10-16 17:00:49,014 INFO L226 Difference]: Without dead ends: 253 [2022-10-16 17:00:49,020 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:49,025 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 311 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:49,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 532 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:00:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-10-16 17:00:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 210. [2022-10-16 17:00:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.4761904761904763) internal successors, (248), 173 states have internal predecessors, (248), 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:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2022-10-16 17:00:49,115 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 55 [2022-10-16 17:00:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:49,116 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2022-10-16 17:00:49,116 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:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2022-10-16 17:00:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:49,120 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:49,120 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:49,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:00:49,121 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:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash -275712372, now seen corresponding path program 1 times [2022-10-16 17:00:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:49,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760553807] [2022-10-16 17:00:49,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:49,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:49,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:49,403 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:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:49,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760553807] [2022-10-16 17:00:49,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760553807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:49,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:49,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621980173] [2022-10-16 17:00:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:49,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:49,409 INFO L87 Difference]: Start difference. First operand 210 states and 301 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:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:50,110 INFO L93 Difference]: Finished difference Result 570 states and 818 transitions. [2022-10-16 17:00:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:00:50,111 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:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:50,116 INFO L225 Difference]: With dead ends: 570 [2022-10-16 17:00:50,116 INFO L226 Difference]: Without dead ends: 369 [2022-10-16 17:00:50,120 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:50,122 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 288 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 839 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:50,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 839 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:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-10-16 17:00:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2022-10-16 17:00:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 244 states have (on average 1.4672131147540983) internal successors, (358), 250 states have internal predecessors, (358), 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:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2022-10-16 17:00:50,182 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 55 [2022-10-16 17:00:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:50,182 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2022-10-16 17:00:50,183 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:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2022-10-16 17:00:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:50,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:50,186 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:50,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:00:50,187 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:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1173105650, now seen corresponding path program 1 times [2022-10-16 17:00:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:50,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424041774] [2022-10-16 17:00:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:50,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:50,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:50,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:50,451 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:50,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424041774] [2022-10-16 17:00:50,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424041774] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:50,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:50,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294406491] [2022-10-16 17:00:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:50,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:50,455 INFO L87 Difference]: Start difference. First operand 303 states and 433 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:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:51,165 INFO L93 Difference]: Finished difference Result 930 states and 1330 transitions. [2022-10-16 17:00:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:00:51,166 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:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:51,172 INFO L225 Difference]: With dead ends: 930 [2022-10-16 17:00:51,172 INFO L226 Difference]: Without dead ends: 636 [2022-10-16 17:00:51,174 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:51,176 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 342 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 821 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.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:51,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 821 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:00:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-10-16 17:00:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 482. [2022-10-16 17:00:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 391 states have (on average 1.4552429667519182) internal successors, (569), 399 states have internal predecessors, (569), 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:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 688 transitions. [2022-10-16 17:00:51,252 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 688 transitions. Word has length 55 [2022-10-16 17:00:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:51,252 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 688 transitions. [2022-10-16 17:00:51,253 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:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 688 transitions. [2022-10-16 17:00:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:51,255 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:51,255 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:51,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 17:00:51,256 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:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash -924959156, now seen corresponding path program 1 times [2022-10-16 17:00:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825958301] [2022-10-16 17:00:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:51,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:51,422 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:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:51,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825958301] [2022-10-16 17:00:51,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825958301] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:51,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:51,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450253339] [2022-10-16 17:00:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:51,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:51,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:51,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:51,428 INFO L87 Difference]: Start difference. First operand 482 states and 688 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:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:52,171 INFO L93 Difference]: Finished difference Result 1494 states and 2133 transitions. [2022-10-16 17:00:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:00:52,172 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:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:52,180 INFO L225 Difference]: With dead ends: 1494 [2022-10-16 17:00:52,181 INFO L226 Difference]: Without dead ends: 1021 [2022-10-16 17:00:52,184 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:52,185 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 285 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 804 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.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:52,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 804 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:00:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-10-16 17:00:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 783. [2022-10-16 17:00:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 634 states have (on average 1.4369085173501577) internal successors, (911), 646 states have internal predecessors, (911), 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:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1116 transitions. [2022-10-16 17:00:52,288 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1116 transitions. Word has length 55 [2022-10-16 17:00:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:52,288 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1116 transitions. [2022-10-16 17:00:52,289 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:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1116 transitions. [2022-10-16 17:00:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:00:52,291 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:52,292 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:52,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 17:00:52,292 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:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash -501312434, now seen corresponding path program 1 times [2022-10-16 17:00:52,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:52,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491460111] [2022-10-16 17:00:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,444 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:52,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:52,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491460111] [2022-10-16 17:00:52,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491460111] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:52,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:52,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:52,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692793921] [2022-10-16 17:00:52,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:52,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:52,448 INFO L87 Difference]: Start difference. First operand 783 states and 1116 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:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:53,067 INFO L93 Difference]: Finished difference Result 2167 states and 3093 transitions. [2022-10-16 17:00:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:00:53,067 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:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:53,078 INFO L225 Difference]: With dead ends: 2167 [2022-10-16 17:00:53,079 INFO L226 Difference]: Without dead ends: 1394 [2022-10-16 17:00:53,082 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:53,083 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 400 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 605 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:53,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 605 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:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-10-16 17:00:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1187. [2022-10-16 17:00:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 955 states have (on average 1.4094240837696335) internal successors, (1346), 976 states have internal predecessors, (1346), 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:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1659 transitions. [2022-10-16 17:00:53,225 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1659 transitions. Word has length 55 [2022-10-16 17:00:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:53,226 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1659 transitions. [2022-10-16 17:00:53,226 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:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1659 transitions. [2022-10-16 17:00:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:53,228 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:53,228 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:53,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 17:00:53,229 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:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 777880458, now seen corresponding path program 1 times [2022-10-16 17:00:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:53,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312117097] [2022-10-16 17:00:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,361 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:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:53,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312117097] [2022-10-16 17:00:53,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312117097] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:53,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:53,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665749659] [2022-10-16 17:00:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:53,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:53,365 INFO L87 Difference]: Start difference. First operand 1187 states and 1659 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:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:53,974 INFO L93 Difference]: Finished difference Result 2581 states and 3659 transitions. [2022-10-16 17:00:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 17:00:53,974 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:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:53,985 INFO L225 Difference]: With dead ends: 2581 [2022-10-16 17:00:53,985 INFO L226 Difference]: Without dead ends: 1404 [2022-10-16 17:00:53,990 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:53,991 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 166 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 561 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:53,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 561 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:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-10-16 17:00:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1202. [2022-10-16 17:00:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 970 states have (on average 1.3938144329896907) internal successors, (1352), 991 states have internal predecessors, (1352), 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:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1665 transitions. [2022-10-16 17:00:54,130 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1665 transitions. Word has length 56 [2022-10-16 17:00:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:54,130 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1665 transitions. [2022-10-16 17:00:54,131 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:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1665 transitions. [2022-10-16 17:00:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:54,133 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:54,133 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:54,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 17:00:54,133 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:54,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 705493900, now seen corresponding path program 1 times [2022-10-16 17:00:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:54,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893928599] [2022-10-16 17:00:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:54,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:54,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:54,255 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:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:54,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893928599] [2022-10-16 17:00:54,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893928599] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:54,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:54,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080323330] [2022-10-16 17:00:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:54,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:54,259 INFO L87 Difference]: Start difference. First operand 1202 states and 1665 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:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:54,807 INFO L93 Difference]: Finished difference Result 2636 states and 3704 transitions. [2022-10-16 17:00:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 17:00:54,808 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:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:54,818 INFO L225 Difference]: With dead ends: 2636 [2022-10-16 17:00:54,819 INFO L226 Difference]: Without dead ends: 1444 [2022-10-16 17:00:54,823 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:54,827 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 131 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 554 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:54,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 554 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:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-10-16 17:00:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1244. [2022-10-16 17:00:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1012 states have (on average 1.3774703557312253) internal successors, (1394), 1033 states have internal predecessors, (1394), 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:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1707 transitions. [2022-10-16 17:00:54,980 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1707 transitions. Word has length 56 [2022-10-16 17:00:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:54,980 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1707 transitions. [2022-10-16 17:00:54,980 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:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1707 transitions. [2022-10-16 17:00:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:54,982 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:54,983 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:54,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 17:00:54,983 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:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1666245362, now seen corresponding path program 1 times [2022-10-16 17:00:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:54,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813820967] [2022-10-16 17:00:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:55,185 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:55,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:55,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813820967] [2022-10-16 17:00:55,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813820967] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:55,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:55,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:00:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976857983] [2022-10-16 17:00:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:55,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:00:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:00:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:00:55,188 INFO L87 Difference]: Start difference. First operand 1244 states and 1707 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:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:55,800 INFO L93 Difference]: Finished difference Result 1802 states and 2473 transitions. [2022-10-16 17:00:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 17:00:55,800 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:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:55,811 INFO L225 Difference]: With dead ends: 1802 [2022-10-16 17:00:55,811 INFO L226 Difference]: Without dead ends: 1068 [2022-10-16 17:00:55,814 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:55,816 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 356 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:55,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 624 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-10-16 17:00:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 898. [2022-10-16 17:00:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 729 states have (on average 1.3662551440329218) internal successors, (996), 743 states have internal predecessors, (996), 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:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1211 transitions. [2022-10-16 17:00:55,917 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1211 transitions. Word has length 56 [2022-10-16 17:00:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:55,918 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1211 transitions. [2022-10-16 17:00:55,918 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:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1211 transitions. [2022-10-16 17:00:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:55,920 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:55,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, 1] [2022-10-16 17:00:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 17:00:55,921 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:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1447390644, now seen corresponding path program 1 times [2022-10-16 17:00:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:55,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333884643] [2022-10-16 17:00:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:56,111 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:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:56,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333884643] [2022-10-16 17:00:56,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333884643] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:56,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:56,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:00:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052421769] [2022-10-16 17:00:56,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:56,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:00:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:00:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:00:56,115 INFO L87 Difference]: Start difference. First operand 898 states and 1211 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:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:56,760 INFO L93 Difference]: Finished difference Result 1745 states and 2359 transitions. [2022-10-16 17:00:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:00:56,764 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:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:56,772 INFO L225 Difference]: With dead ends: 1745 [2022-10-16 17:00:56,773 INFO L226 Difference]: Without dead ends: 1096 [2022-10-16 17:00:56,776 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:56,779 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 346 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:56,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 629 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:00:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-10-16 17:00:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 892. [2022-10-16 17:00:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 725 states have (on average 1.3613793103448275) internal successors, (987), 737 states have internal predecessors, (987), 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:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1194 transitions. [2022-10-16 17:00:56,877 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1194 transitions. Word has length 56 [2022-10-16 17:00:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:56,877 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1194 transitions. [2022-10-16 17:00:56,878 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:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1194 transitions. [2022-10-16 17:00:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:56,879 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:56,879 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:56,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 17:00:56,879 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:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1024688818, now seen corresponding path program 1 times [2022-10-16 17:00:56,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:56,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631561496] [2022-10-16 17:00:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:56,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,070 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:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:57,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631561496] [2022-10-16 17:00:57,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631561496] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:57,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:57,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:00:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071187875] [2022-10-16 17:00:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:57,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:00:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:00:57,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:00:57,073 INFO L87 Difference]: Start difference. First operand 892 states and 1194 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:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:57,693 INFO L93 Difference]: Finished difference Result 1689 states and 2257 transitions. [2022-10-16 17:00:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 17:00:57,694 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:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:57,701 INFO L225 Difference]: With dead ends: 1689 [2022-10-16 17:00:57,701 INFO L226 Difference]: Without dead ends: 952 [2022-10-16 17:00:57,704 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:57,705 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 384 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:57,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 576 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:00:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-10-16 17:00:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 780. [2022-10-16 17:00:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 638 states have (on average 1.3573667711598747) internal successors, (866), 648 states have internal predecessors, (866), 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:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2022-10-16 17:00:57,798 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 56 [2022-10-16 17:00:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:57,798 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2022-10-16 17:00:57,798 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:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2022-10-16 17:00:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 17:00:57,799 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:57,800 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:57,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 17:00:57,800 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:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1842337268, now seen corresponding path program 1 times [2022-10-16 17:00:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:57,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734920309] [2022-10-16 17:00:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:57,898 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:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:57,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734920309] [2022-10-16 17:00:57,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734920309] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:57,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:57,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105900731] [2022-10-16 17:00:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:57,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:57,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:57,902 INFO L87 Difference]: Start difference. First operand 780 states and 1038 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:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:58,402 INFO L93 Difference]: Finished difference Result 2410 states and 3254 transitions. [2022-10-16 17:00:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:00:58,403 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:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:58,415 INFO L225 Difference]: With dead ends: 2410 [2022-10-16 17:00:58,416 INFO L226 Difference]: Without dead ends: 1641 [2022-10-16 17:00:58,419 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:58,420 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 378 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 367 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:58,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 367 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:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-10-16 17:00:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1467. [2022-10-16 17:00:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1197 states have (on average 1.3350041771094403) internal successors, (1598), 1214 states have internal predecessors, (1598), 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:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1957 transitions. [2022-10-16 17:00:58,632 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1957 transitions. Word has length 56 [2022-10-16 17:00:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:58,632 INFO L495 AbstractCegarLoop]: Abstraction has 1467 states and 1957 transitions. [2022-10-16 17:00:58,632 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:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1957 transitions. [2022-10-16 17:00:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 17:00:58,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:58,634 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:58,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 17:00:58,635 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:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1987017488, now seen corresponding path program 1 times [2022-10-16 17:00:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:58,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846758051] [2022-10-16 17:00:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:58,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:58,707 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:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:58,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846758051] [2022-10-16 17:00:58,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846758051] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:58,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:58,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:00:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000393523] [2022-10-16 17:00:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:58,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:00:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:58,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:00:58,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:00:58,710 INFO L87 Difference]: Start difference. First operand 1467 states and 1957 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:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:59,300 INFO L93 Difference]: Finished difference Result 4191 states and 5620 transitions. [2022-10-16 17:00:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:00:59,301 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:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:59,320 INFO L225 Difference]: With dead ends: 4191 [2022-10-16 17:00:59,320 INFO L226 Difference]: Without dead ends: 2738 [2022-10-16 17:00:59,327 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:59,328 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 312 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 412 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:59,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 412 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:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2022-10-16 17:00:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2392. [2022-10-16 17:00:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1948 states have (on average 1.320328542094456) internal successors, (2572), 1975 states have internal predecessors, (2572), 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:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3160 transitions. [2022-10-16 17:00:59,661 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3160 transitions. Word has length 57 [2022-10-16 17:00:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:59,662 INFO L495 AbstractCegarLoop]: Abstraction has 2392 states and 3160 transitions. [2022-10-16 17:00:59,663 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:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3160 transitions. [2022-10-16 17:00:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 17:00:59,664 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:59,665 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:59,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 17:00:59,665 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:59,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash 772242277, now seen corresponding path program 1 times [2022-10-16 17:00:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:59,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019768361] [2022-10-16 17:00:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:59,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:00:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:59,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:00:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:00:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 17:00:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:59,779 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:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:59,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019768361] [2022-10-16 17:00:59,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019768361] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:59,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:59,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561268855] [2022-10-16 17:00:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:59,782 INFO L87 Difference]: Start difference. First operand 2392 states and 3160 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:01:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:00,959 INFO L93 Difference]: Finished difference Result 7577 states and 10103 transitions. [2022-10-16 17:01:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:01:00,959 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:01:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:00,996 INFO L225 Difference]: With dead ends: 7577 [2022-10-16 17:01:00,996 INFO L226 Difference]: Without dead ends: 5201 [2022-10-16 17:01:01,006 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:01:01,009 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 707 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 576 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:01:01,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 576 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:01:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-10-16 17:01:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4675. [2022-10-16 17:01:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4675 states, 3792 states have (on average 1.298259493670886) internal successors, (4923), 3861 states have internal predecessors, (4923), 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:01:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6197 transitions. [2022-10-16 17:01:01,632 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6197 transitions. Word has length 74 [2022-10-16 17:01:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:01,633 INFO L495 AbstractCegarLoop]: Abstraction has 4675 states and 6197 transitions. [2022-10-16 17:01:01,633 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:01:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6197 transitions. [2022-10-16 17:01:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 17:01:01,637 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:01,637 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:01:01,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 17:01:01,638 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:01:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 237737077, now seen corresponding path program 1 times [2022-10-16 17:01:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:01,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272936581] [2022-10-16 17:01:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:01:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:01:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:01:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 17:01:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:01:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 17:01:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,927 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:01:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:01,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272936581] [2022-10-16 17:01:01,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272936581] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:01,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:01,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177927532] [2022-10-16 17:01:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:01,930 INFO L87 Difference]: Start difference. First operand 4675 states and 6197 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:01:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:02,885 INFO L93 Difference]: Finished difference Result 8997 states and 11865 transitions. [2022-10-16 17:01:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:01:02,886 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:01:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:02,922 INFO L225 Difference]: With dead ends: 8997 [2022-10-16 17:01:02,922 INFO L226 Difference]: Without dead ends: 5271 [2022-10-16 17:01:02,936 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:01:02,937 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 473 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:02,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 454 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 17:01:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2022-10-16 17:01:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 4643. [2022-10-16 17:01:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3756 states have (on average 1.286741214057508) internal successors, (4833), 3829 states have internal predecessors, (4833), 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:01:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6026 transitions. [2022-10-16 17:01:03,538 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6026 transitions. Word has length 90 [2022-10-16 17:01:03,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:03,538 INFO L495 AbstractCegarLoop]: Abstraction has 4643 states and 6026 transitions. [2022-10-16 17:01:03,539 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:01:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6026 transitions. [2022-10-16 17:01:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 17:01:03,542 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:03,542 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:01:03,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 17:01:03,543 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:01:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1804495027, now seen corresponding path program 1 times [2022-10-16 17:01:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:03,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893811670] [2022-10-16 17:01:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:03,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:01:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:01:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:01:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 17:01:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:01:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 17:01:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:03,619 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:01:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:03,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893811670] [2022-10-16 17:01:03,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893811670] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:03,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:03,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:01:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986333083] [2022-10-16 17:01:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:03,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:01:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:03,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:01:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:01:03,622 INFO L87 Difference]: Start difference. First operand 4643 states and 6026 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:01:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:04,284 INFO L93 Difference]: Finished difference Result 5107 states and 6643 transitions. [2022-10-16 17:01:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:01:04,285 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:01:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:04,313 INFO L225 Difference]: With dead ends: 5107 [2022-10-16 17:01:04,313 INFO L226 Difference]: Without dead ends: 4196 [2022-10-16 17:01:04,319 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:01:04,319 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 258 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 263 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:01:04,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 263 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:01:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2022-10-16 17:01:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 3734. [2022-10-16 17:01:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.2913776015857283) internal successors, (3909), 3088 states have internal predecessors, (3909), 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:01:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4861 transitions. [2022-10-16 17:01:04,722 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4861 transitions. Word has length 90 [2022-10-16 17:01:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:04,722 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4861 transitions. [2022-10-16 17:01:04,722 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:01:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4861 transitions. [2022-10-16 17:01:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 17:01:04,725 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:04,725 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:01:04,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 17:01:04,725 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:01:04,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1432721063, now seen corresponding path program 1 times [2022-10-16 17:01:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:04,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779398465] [2022-10-16 17:01:04,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 17:01:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 17:01:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:01:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 17:01:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 17:01:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 17:01:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:04,839 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:01:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:04,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779398465] [2022-10-16 17:01:04,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779398465] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:04,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:01:04,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:01:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914212961] [2022-10-16 17:01:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:04,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:01:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:01:04,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:01:04,842 INFO L87 Difference]: Start difference. First operand 3734 states and 4861 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:01:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:06,058 INFO L93 Difference]: Finished difference Result 7161 states and 9288 transitions. [2022-10-16 17:01:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 17:01:06,058 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:01:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:06,081 INFO L225 Difference]: With dead ends: 7161 [2022-10-16 17:01:06,081 INFO L226 Difference]: Without dead ends: 4113 [2022-10-16 17:01:06,091 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:01:06,092 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 1007 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 664 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:01:06,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 664 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 17:01:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2022-10-16 17:01:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3734. [2022-10-16 17:01:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.276841757515692) internal successors, (3865), 3088 states have internal predecessors, (3865), 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:01:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4751 transitions. [2022-10-16 17:01:06,501 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4751 transitions. Word has length 91 [2022-10-16 17:01:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:06,502 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4751 transitions. [2022-10-16 17:01:06,502 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:01:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4751 transitions. [2022-10-16 17:01:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 17:01:06,504 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:06,504 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:01:06,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 17:01:06,505 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:01:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash 578901004, now seen corresponding path program 1 times [2022-10-16 17:01:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:06,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027266542] [2022-10-16 17:01:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:01:06,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 17:01:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 17:01:06,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 17:01:06,573 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 17:01:06,575 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-10-16 17:01:06,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-10-16 17:01:06,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-10-16 17:01:06,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-10-16 17:01:06,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 17:01:06,582 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:01:06,587 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 17:01:06,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:01:06 BoogieIcfgContainer [2022-10-16 17:01:06,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 17:01:06,724 INFO L158 Benchmark]: Toolchain (without parser) took 20662.55ms. Allocated memory was 163.6MB in the beginning and 611.3MB in the end (delta: 447.7MB). Free memory was 136.8MB in the beginning and 257.0MB in the end (delta: -120.2MB). Peak memory consumption was 327.8MB. Max. memory is 8.0GB. [2022-10-16 17:01:06,724 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 133.6MB in the end (delta: 85.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 17:01:06,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.51ms. Allocated memory is still 163.6MB. Free memory was 136.7MB in the beginning and 123.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 17:01:06,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.84ms. Allocated memory is still 163.6MB. Free memory was 123.7MB in the beginning and 121.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:01:06,728 INFO L158 Benchmark]: Boogie Preprocessor took 71.40ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 120.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:01:06,728 INFO L158 Benchmark]: RCFGBuilder took 714.12ms. Allocated memory is still 163.6MB. Free memory was 119.9MB in the beginning and 134.9MB in the end (delta: -14.9MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-10-16 17:01:06,729 INFO L158 Benchmark]: TraceAbstraction took 19458.40ms. Allocated memory was 163.6MB in the beginning and 611.3MB in the end (delta: 447.7MB). Free memory was 133.8MB in the beginning and 257.0MB in the end (delta: -123.2MB). Peak memory consumption was 324.0MB. Max. memory is 8.0GB. [2022-10-16 17:01:06,734 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.18ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 133.6MB in the end (delta: 85.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 339.51ms. Allocated memory is still 163.6MB. Free memory was 136.7MB in the beginning and 123.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.84ms. Allocated memory is still 163.6MB. Free memory was 123.7MB in the beginning and 121.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.40ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 120.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 714.12ms. Allocated memory is still 163.6MB. Free memory was 119.9MB in the beginning and 134.9MB in the end (delta: -14.9MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * TraceAbstraction took 19458.40ms. Allocated memory was 163.6MB in the beginning and 611.3MB in the end (delta: 447.7MB). Free memory was 133.8MB in the beginning and 257.0MB in the end (delta: -123.2MB). Peak memory consumption was 324.0MB. 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: 119]: 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] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] 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] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] 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] [L433] 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] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] 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] [L187] COND TRUE t1_i == 1 [L188] 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] [L434] RET init_threads() [L435] 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] [L271] 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] [L276] 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] [L281] 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] [L286] 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] [L435] 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] [L436] 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] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] 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] [L136] 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] [L146] __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] [L148] 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] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] 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] [L337] CALL, EXPR is_transmit1_triggered() [L152] 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] [L155] 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] [L165] __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] [L167] 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] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] 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] [L436] 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] [L437] 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] [L299] 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] [L304] 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] [L309] 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] [L314] 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] [L437] 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] [L440] 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] [L443] kernel_st = 1 [L444] CALL eval() [L218] 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] [L222] 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] [L225] 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] [L197] 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] [L200] COND TRUE m_st == 0 [L201] __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] [L213] 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] [L225] 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] [L225] tmp = exists_runnable_thread() [L227] 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] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] 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] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] 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] [L111] 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] [L113] t1_pc = 1 [L114] 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] [L252] RET transmit1() [L222] 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] [L225] 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] [L197] 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] [L200] COND TRUE m_st == 0 [L201] __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] [L213] 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] [L225] 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] [L225] tmp = exists_runnable_thread() [L227] 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] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [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, tmp_var=0, 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, tmp_var=0, 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, tmp_var=0, 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] [L353] 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] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] 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] [L136] 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] [L146] __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] [L148] 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] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] 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] [L337] CALL, EXPR is_transmit1_triggered() [L152] 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] [L155] 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] [L156] COND TRUE E_1 == 1 [L157] __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] [L167] 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] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] 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] [L353] 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, tmp_var=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, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] 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] [L103] 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] [L119] 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: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 121 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6294 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6144 mSDsluCounter, 9281 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6307 mSDsCounter, 1616 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7153 IncrementalHoareTripleChecker+Invalid, 8769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1616 mSolverCounterUnsat, 2974 mSDtfsCounter, 7153 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.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4675occurred 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, 4171 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s 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:01:06,790 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...