./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 01:58:09,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 01:58:09,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 01:58:09,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 01:58:09,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 01:58:09,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 01:58:09,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 01:58:09,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 01:58:09,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 01:58:09,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 01:58:09,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 01:58:09,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 01:58:09,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 01:58:09,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 01:58:09,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 01:58:09,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 01:58:09,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 01:58:09,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 01:58:09,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 01:58:09,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 01:58:09,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 01:58:09,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 01:58:09,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 01:58:09,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 01:58:09,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 01:58:09,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 01:58:09,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 01:58:09,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 01:58:09,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 01:58:09,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 01:58:09,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 01:58:09,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 01:58:09,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 01:58:09,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 01:58:09,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 01:58:09,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 01:58:09,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 01:58:09,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 01:58:09,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 01:58:09,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 01:58:09,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 01:58:09,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 01:58:09,344 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 01:58:09,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 01:58:09,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 01:58:09,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 01:58:09,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 01:58:09,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 01:58:09,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 01:58:09,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 01:58:09,347 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 01:58:09,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 01:58:09,348 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 01:58:09,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 01:58:09,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 01:58:09,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 01:58:09,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 01:58:09,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 01:58:09,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 01:58:09,350 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 01:58:09,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 01:58:09,350 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 01:58:09,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 01:58:09,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 01:58:09,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 01:58:09,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 01:58:09,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:58:09,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 01:58:09,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 01:58:09,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 01:58:09,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 01:58:09,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 01:58:09,352 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 01:58:09,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 01:58:09,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 01:58:09,353 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 [2021-12-28 01:58:09,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 01:58:09,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 01:58:09,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 01:58:09,692 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 01:58:09,695 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 01:58:09,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2021-12-28 01:58:09,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6113b92/79f410455bc14429b59152d765e99689/FLAG0caed5d2d [2021-12-28 01:58:10,577 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 01:58:10,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2021-12-28 01:58:10,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6113b92/79f410455bc14429b59152d765e99689/FLAG0caed5d2d [2021-12-28 01:58:11,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6113b92/79f410455bc14429b59152d765e99689 [2021-12-28 01:58:11,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 01:58:11,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 01:58:11,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 01:58:11,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 01:58:11,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 01:58:11,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:58:11" (1/1) ... [2021-12-28 01:58:11,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474c0be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:11, skipping insertion in model container [2021-12-28 01:58:11,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:58:11" (1/1) ... [2021-12-28 01:58:11,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 01:58:11,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 01:58:13,320 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/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2021-12-28 01:58:13,338 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/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2021-12-28 01:58:13,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:58:13,449 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 01:58:14,396 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/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2021-12-28 01:58:14,400 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/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2021-12-28 01:58:14,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:58:14,505 INFO L208 MainTranslator]: Completed translation [2021-12-28 01:58:14,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14 WrapperNode [2021-12-28 01:58:14,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 01:58:14,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 01:58:14,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 01:58:14,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 01:58:14,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:14,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,052 INFO L137 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2021-12-28 01:58:15,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 01:58:15,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 01:58:15,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 01:58:15,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 01:58:15,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 01:58:15,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 01:58:15,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 01:58:15,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 01:58:15,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (1/1) ... [2021-12-28 01:58:15,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:58:15,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:15,552 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) [2021-12-28 01:58:15,559 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 [2021-12-28 01:58:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 01:58:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-28 01:58:15,585 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-28 01:58:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-28 01:58:15,585 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-28 01:58:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-28 01:58:15,586 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-28 01:58:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-28 01:58:15,586 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-28 01:58:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-28 01:58:15,586 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-28 01:58:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-28 01:58:15,587 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-28 01:58:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 01:58:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-28 01:58:15,587 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-28 01:58:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 01:58:15,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 01:58:15,693 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 01:58:15,694 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 01:58:21,440 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 01:58:21,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 01:58:21,472 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-28 01:58:21,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:58:21 BoogieIcfgContainer [2021-12-28 01:58:21,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 01:58:21,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 01:58:21,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 01:58:21,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 01:58:21,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:58:11" (1/3) ... [2021-12-28 01:58:21,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e4bd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:58:21, skipping insertion in model container [2021-12-28 01:58:21,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:58:14" (2/3) ... [2021-12-28 01:58:21,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e4bd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:58:21, skipping insertion in model container [2021-12-28 01:58:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:58:21" (3/3) ... [2021-12-28 01:58:21,483 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.01.cil-2.c [2021-12-28 01:58:21,486 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 01:58:21,487 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 01:58:21,536 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 01:58:21,541 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 01:58:21,541 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-28 01:58:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 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) [2021-12-28 01:58:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-28 01:58:21,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:21,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:21,656 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2021-12-28 01:58:21,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:21,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919632849] [2021-12-28 01:58:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:21,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:21,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:21,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:58:21,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919632849] [2021-12-28 01:58:21,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919632849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:21,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:58:21,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:58:22,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502697] [2021-12-28 01:58:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:22,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:58:22,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:22,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:58:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:58:22,041 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 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.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:22,744 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2021-12-28 01:58:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:58:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-28 01:58:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:22,778 INFO L225 Difference]: With dead ends: 4727 [2021-12-28 01:58:22,778 INFO L226 Difference]: Without dead ends: 2368 [2021-12-28 01:58:22,789 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:58:22,793 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16579 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:22,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4337 Valid, 16579 Invalid, 494 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:58:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-12-28 01:58:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2021-12-28 01:58:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-28 01:58:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2021-12-28 01:58:22,944 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2021-12-28 01:58:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:22,944 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2021-12-28 01:58:22,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2021-12-28 01:58:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-28 01:58:22,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:22,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:22,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 01:58:22,955 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:22,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2021-12-28 01:58:22,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:22,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464123604] [2021-12-28 01:58:22,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:22,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:58:23,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464123604] [2021-12-28 01:58:23,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464123604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:23,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:58:23,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:58:23,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835664873] [2021-12-28 01:58:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:23,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:58:23,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:23,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:58:23,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:58:23,072 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:23,759 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2021-12-28 01:58:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 01:58:23,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-28 01:58:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:23,772 INFO L225 Difference]: With dead ends: 2676 [2021-12-28 01:58:23,772 INFO L226 Difference]: Without dead ends: 2481 [2021-12-28 01:58:23,774 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:58:23,775 INFO L933 BasicCegarLoop]: 4200 mSDtfsCounter, 4245 mSDsluCounter, 16382 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 20582 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:23,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4253 Valid, 20582 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 01:58:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2021-12-28 01:58:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2021-12-28 01:58:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2021-12-28 01:58:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2021-12-28 01:58:23,843 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2021-12-28 01:58:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:23,844 INFO L470 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2021-12-28 01:58:23,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2021-12-28 01:58:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-28 01:58:23,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:23,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:23,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 01:58:23,847 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2021-12-28 01:58:23,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:23,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577352039] [2021-12-28 01:58:23,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:23,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:58:23,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577352039] [2021-12-28 01:58:23,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577352039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:23,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:58:23,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:58:23,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150289064] [2021-12-28 01:58:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:23,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:58:23,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:58:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:58:23,927 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:24,631 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions. [2021-12-28 01:58:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 01:58:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-28 01:58:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:24,644 INFO L225 Difference]: With dead ends: 3027 [2021-12-28 01:58:24,644 INFO L226 Difference]: Without dead ends: 2742 [2021-12-28 01:58:24,646 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:58:24,647 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 4299 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 20564 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:24,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4309 Valid, 20564 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 01:58:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2021-12-28 01:58:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590. [2021-12-28 01:58:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-28 01:58:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions. [2021-12-28 01:58:24,718 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58 [2021-12-28 01:58:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:24,719 INFO L470 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions. [2021-12-28 01:58:24,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions. [2021-12-28 01:58:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-28 01:58:24,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:24,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:24,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 01:58:24,721 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:24,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:24,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2021-12-28 01:58:24,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:24,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697525225] [2021-12-28 01:58:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:24,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:24,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:24,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:58:24,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:24,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697525225] [2021-12-28 01:58:24,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697525225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:24,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:58:24,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:58:24,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263731959] [2021-12-28 01:58:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:24,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:58:24,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:58:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:58:24,793 INFO L87 Difference]: Start difference. First operand 2590 states and 4630 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:25,563 INFO L93 Difference]: Finished difference Result 3579 states and 6048 transitions. [2021-12-28 01:58:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 01:58:25,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-28 01:58:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:25,578 INFO L225 Difference]: With dead ends: 3579 [2021-12-28 01:58:25,579 INFO L226 Difference]: Without dead ends: 3119 [2021-12-28 01:58:25,583 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:58:25,590 INFO L933 BasicCegarLoop]: 4191 mSDtfsCounter, 4242 mSDsluCounter, 16356 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20547 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:25,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4249 Valid, 20547 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 01:58:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2021-12-28 01:58:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2889. [2021-12-28 01:58:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2740 states have (on average 1.7682481751824817) internal successors, (4845), 2751 states have internal predecessors, (4845), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2021-12-28 01:58:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5052 transitions. [2021-12-28 01:58:25,672 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5052 transitions. Word has length 58 [2021-12-28 01:58:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:25,672 INFO L470 AbstractCegarLoop]: Abstraction has 2889 states and 5052 transitions. [2021-12-28 01:58:25,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5052 transitions. [2021-12-28 01:58:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-28 01:58:25,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:25,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:25,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 01:58:25,682 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:25,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2021-12-28 01:58:25,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:25,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567895286] [2021-12-28 01:58:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:25,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:25,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:25,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:25,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:58:25,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:25,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567895286] [2021-12-28 01:58:25,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567895286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:25,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:58:25,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:58:25,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432675865] [2021-12-28 01:58:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:25,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:58:25,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:58:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:58:25,785 INFO L87 Difference]: Start difference. First operand 2889 states and 5052 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:26,310 INFO L93 Difference]: Finished difference Result 4253 states and 6998 transitions. [2021-12-28 01:58:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:58:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-28 01:58:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:26,324 INFO L225 Difference]: With dead ends: 4253 [2021-12-28 01:58:26,325 INFO L226 Difference]: Without dead ends: 3495 [2021-12-28 01:58:26,328 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:58:26,328 INFO L933 BasicCegarLoop]: 4225 mSDtfsCounter, 4354 mSDsluCounter, 12183 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:26,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4377 Valid, 16408 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:58:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2021-12-28 01:58:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3290. [2021-12-28 01:58:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3058 states have (on average 1.723675604970569) internal successors, (5271), 3078 states have internal predecessors, (5271), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2021-12-28 01:58:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5586 transitions. [2021-12-28 01:58:26,427 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5586 transitions. Word has length 58 [2021-12-28 01:58:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:26,428 INFO L470 AbstractCegarLoop]: Abstraction has 3290 states and 5586 transitions. [2021-12-28 01:58:26,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:58:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5586 transitions. [2021-12-28 01:58:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-28 01:58:26,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:26,432 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-28 01:58:26,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 01:58:26,432 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2021-12-28 01:58:26,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731740047] [2021-12-28 01:58:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:26,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-28 01:58:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 01:58:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 01:58:26,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:26,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731740047] [2021-12-28 01:58:26,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731740047] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:26,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438908760] [2021-12-28 01:58:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:26,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:26,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:26,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:26,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 01:58:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:26,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:58:26,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-28 01:58:26,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:26,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438908760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:26,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:26,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:58:26,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088769705] [2021-12-28 01:58:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:26,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:58:26,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:26,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:58:26,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:26,806 INFO L87 Difference]: Start difference. First operand 3290 states and 5586 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:26,901 INFO L93 Difference]: Finished difference Result 5496 states and 8712 transitions. [2021-12-28 01:58:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:58:26,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-28 01:58:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:26,919 INFO L225 Difference]: With dead ends: 5496 [2021-12-28 01:58:26,920 INFO L226 Difference]: Without dead ends: 4338 [2021-12-28 01:58:26,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:26,927 INFO L933 BasicCegarLoop]: 4229 mSDtfsCounter, 114 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 8337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:26,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 8337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:58:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2021-12-28 01:58:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2021-12-28 01:58:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3897 states have (on average 1.6440851937387735) internal successors, (6407), 3930 states have internal predecessors, (6407), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2021-12-28 01:58:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7038 transitions. [2021-12-28 01:58:27,072 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7038 transitions. Word has length 93 [2021-12-28 01:58:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:27,075 INFO L470 AbstractCegarLoop]: Abstraction has 4338 states and 7038 transitions. [2021-12-28 01:58:27,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7038 transitions. [2021-12-28 01:58:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-28 01:58:27,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:27,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:27,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:27,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 01:58:27,313 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:27,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2021-12-28 01:58:27,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:27,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528382814] [2021-12-28 01:58:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:27,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-28 01:58:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:58:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-28 01:58:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 01:58:27,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:27,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528382814] [2021-12-28 01:58:27,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528382814] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:27,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372087956] [2021-12-28 01:58:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:27,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:27,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:27,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:27,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 01:58:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:27,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:58:27,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-28 01:58:27,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:27,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372087956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:27,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:27,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-28 01:58:27,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126535945] [2021-12-28 01:58:27,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:27,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:58:27,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:58:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:27,719 INFO L87 Difference]: Start difference. First operand 4338 states and 7038 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 01:58:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:27,870 INFO L93 Difference]: Finished difference Result 8608 states and 13011 transitions. [2021-12-28 01:58:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:58:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-28 01:58:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:27,900 INFO L225 Difference]: With dead ends: 8608 [2021-12-28 01:58:27,901 INFO L226 Difference]: Without dead ends: 6405 [2021-12-28 01:58:27,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:27,911 INFO L933 BasicCegarLoop]: 4141 mSDtfsCounter, 4038 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4273 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:27,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4038 Valid, 4273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:58:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2021-12-28 01:58:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6345. [2021-12-28 01:58:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 5510 states have (on average 1.561705989110708) internal successors, (8605), 5572 states have internal predecessors, (8605), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2021-12-28 01:58:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 9768 transitions. [2021-12-28 01:58:28,114 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 9768 transitions. Word has length 119 [2021-12-28 01:58:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:28,115 INFO L470 AbstractCegarLoop]: Abstraction has 6345 states and 9768 transitions. [2021-12-28 01:58:28,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 01:58:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 9768 transitions. [2021-12-28 01:58:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:58:28,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:28,125 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-28 01:58:28,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:28,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-28 01:58:28,340 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2021-12-28 01:58:28,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:28,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022956205] [2021-12-28 01:58:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:28,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:58:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:58:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:58:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 01:58:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-28 01:58:28,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:28,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022956205] [2021-12-28 01:58:28,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022956205] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:28,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115152049] [2021-12-28 01:58:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:28,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:28,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:28,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:28,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 01:58:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:28,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:58:28,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-28 01:58:28,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:28,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115152049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:28,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:28,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:58:28,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407173182] [2021-12-28 01:58:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:28,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:58:28,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:58:28,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:28,735 INFO L87 Difference]: Start difference. First operand 6345 states and 9768 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 01:58:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:28,959 INFO L93 Difference]: Finished difference Result 9619 states and 14299 transitions. [2021-12-28 01:58:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:58:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2021-12-28 01:58:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:28,982 INFO L225 Difference]: With dead ends: 9619 [2021-12-28 01:58:28,982 INFO L226 Difference]: Without dead ends: 6673 [2021-12-28 01:58:28,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:28,994 INFO L933 BasicCegarLoop]: 4132 mSDtfsCounter, 4059 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:28,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4059 Valid, 4272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:58:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2021-12-28 01:58:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6635. [2021-12-28 01:58:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 5768 states have (on average 1.535887656033287) internal successors, (8859), 5830 states have internal predecessors, (8859), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2021-12-28 01:58:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 10060 transitions. [2021-12-28 01:58:29,215 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 10060 transitions. Word has length 135 [2021-12-28 01:58:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:29,215 INFO L470 AbstractCegarLoop]: Abstraction has 6635 states and 10060 transitions. [2021-12-28 01:58:29,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 01:58:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 10060 transitions. [2021-12-28 01:58:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 01:58:29,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:29,225 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-28 01:58:29,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:29,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:29,439 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2021-12-28 01:58:29,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:29,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485790520] [2021-12-28 01:58:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:29,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:58:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:58:29,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:29,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485790520] [2021-12-28 01:58:29,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485790520] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:29,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802099840] [2021-12-28 01:58:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:29,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:29,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:29,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 01:58:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:29,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:58:29,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 01:58:29,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:29,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802099840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:29,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:29,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:58:29,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076478430] [2021-12-28 01:58:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:29,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:58:29,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:58:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:29,824 INFO L87 Difference]: Start difference. First operand 6635 states and 10060 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 01:58:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:29,978 INFO L93 Difference]: Finished difference Result 9031 states and 13439 transitions. [2021-12-28 01:58:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:58:29,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-28 01:58:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:30,001 INFO L225 Difference]: With dead ends: 9031 [2021-12-28 01:58:30,001 INFO L226 Difference]: Without dead ends: 6671 [2021-12-28 01:58:30,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:30,016 INFO L933 BasicCegarLoop]: 4217 mSDtfsCounter, 111 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8316 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:30,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 8316 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:58:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2021-12-28 01:58:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6611. [2021-12-28 01:58:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6611 states, 5744 states have (on average 1.5217618384401115) internal successors, (8741), 5806 states have internal predecessors, (8741), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2021-12-28 01:58:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 9942 transitions. [2021-12-28 01:58:30,221 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 9942 transitions. Word has length 136 [2021-12-28 01:58:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:30,222 INFO L470 AbstractCegarLoop]: Abstraction has 6611 states and 9942 transitions. [2021-12-28 01:58:30,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 01:58:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 9942 transitions. [2021-12-28 01:58:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 01:58:30,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:30,233 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-28 01:58:30,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:30,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:30,447 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2021-12-28 01:58:30,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:30,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104131123] [2021-12-28 01:58:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:30,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:58:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:58:30,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104131123] [2021-12-28 01:58:30,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104131123] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394632077] [2021-12-28 01:58:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:30,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:30,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:30,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:30,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 01:58:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:30,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:58:30,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 01:58:30,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:30,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394632077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:30,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:30,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:58:30,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291626100] [2021-12-28 01:58:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:30,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:58:30,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:58:30,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:30,810 INFO L87 Difference]: Start difference. First operand 6611 states and 9942 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 01:58:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:30,952 INFO L93 Difference]: Finished difference Result 9935 states and 14498 transitions. [2021-12-28 01:58:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:58:30,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2021-12-28 01:58:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:30,970 INFO L225 Difference]: With dead ends: 9935 [2021-12-28 01:58:30,971 INFO L226 Difference]: Without dead ends: 5993 [2021-12-28 01:58:30,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:58:30,983 INFO L933 BasicCegarLoop]: 4112 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:30,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4089 Valid, 4136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:58:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2021-12-28 01:58:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5763. [2021-12-28 01:58:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5763 states, 5062 states have (on average 1.5205452390359542) internal successors, (7697), 5108 states have internal predecessors, (7697), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2021-12-28 01:58:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 8600 transitions. [2021-12-28 01:58:31,306 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 8600 transitions. Word has length 136 [2021-12-28 01:58:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:31,307 INFO L470 AbstractCegarLoop]: Abstraction has 5763 states and 8600 transitions. [2021-12-28 01:58:31,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 01:58:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 8600 transitions. [2021-12-28 01:58:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-28 01:58:31,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:31,316 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:31,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:31,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-28 01:58:31,540 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:31,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2021-12-28 01:58:31,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:31,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389369406] [2021-12-28 01:58:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:31,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 01:58:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:58:31,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389369406] [2021-12-28 01:58:31,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389369406] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:31,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741096253] [2021-12-28 01:58:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:31,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:31,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:31,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:31,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 01:58:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:31,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:58:31,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 01:58:31,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:31,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741096253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:31,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:31,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-28 01:58:31,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503313766] [2021-12-28 01:58:31,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:31,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:58:31,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:58:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 01:58:31,987 INFO L87 Difference]: Start difference. First operand 5763 states and 8600 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:32,231 INFO L93 Difference]: Finished difference Result 7191 states and 10479 transitions. [2021-12-28 01:58:32,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:58:32,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-28 01:58:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:32,244 INFO L225 Difference]: With dead ends: 7191 [2021-12-28 01:58:32,244 INFO L226 Difference]: Without dead ends: 4833 [2021-12-28 01:58:32,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:58:32,250 INFO L933 BasicCegarLoop]: 4090 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12161 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:32,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4115 Valid, 12161 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:58:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2021-12-28 01:58:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4821. [2021-12-28 01:58:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 4302 states have (on average 1.5488145048814506) internal successors, (6663), 4330 states have internal predecessors, (6663), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2021-12-28 01:58:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7314 transitions. [2021-12-28 01:58:32,413 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7314 transitions. Word has length 137 [2021-12-28 01:58:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:32,414 INFO L470 AbstractCegarLoop]: Abstraction has 4821 states and 7314 transitions. [2021-12-28 01:58:32,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7314 transitions. [2021-12-28 01:58:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-28 01:58:32,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:32,418 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:32,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:32,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:32,631 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2021-12-28 01:58:32,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:32,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016898873] [2021-12-28 01:58:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:32,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 01:58:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:58:32,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:32,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016898873] [2021-12-28 01:58:32,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016898873] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:32,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785749474] [2021-12-28 01:58:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:32,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:32,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:32,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:32,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 01:58:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:32,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:58:32,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 01:58:33,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:33,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785749474] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:33,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:33,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-28 01:58:33,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324717515] [2021-12-28 01:58:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:33,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:58:33,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:58:33,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 01:58:33,064 INFO L87 Difference]: Start difference. First operand 4821 states and 7314 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:33,357 INFO L93 Difference]: Finished difference Result 7162 states and 10301 transitions. [2021-12-28 01:58:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:58:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-28 01:58:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:33,370 INFO L225 Difference]: With dead ends: 7162 [2021-12-28 01:58:33,370 INFO L226 Difference]: Without dead ends: 4769 [2021-12-28 01:58:33,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-28 01:58:33,377 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12168 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:33,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4136 Valid, 12168 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:58:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2021-12-28 01:58:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3795. [2021-12-28 01:58:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-28 01:58:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2021-12-28 01:58:33,504 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2021-12-28 01:58:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:33,504 INFO L470 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2021-12-28 01:58:33,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2021-12-28 01:58:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-28 01:58:33,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:33,508 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:33,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:33,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:33,731 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2021-12-28 01:58:33,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:33,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520081149] [2021-12-28 01:58:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:33,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 01:58:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:58:33,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:33,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520081149] [2021-12-28 01:58:33,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520081149] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:33,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029374657] [2021-12-28 01:58:33,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:33,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:33,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:33,855 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:33,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 01:58:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:58:34,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-28 01:58:34,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:34,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029374657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:34,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:34,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-28 01:58:34,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224149989] [2021-12-28 01:58:34,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:34,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:58:34,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:58:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:58:34,252 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:34,428 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2021-12-28 01:58:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:58:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-28 01:58:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:34,436 INFO L225 Difference]: With dead ends: 4934 [2021-12-28 01:58:34,437 INFO L226 Difference]: Without dead ends: 3270 [2021-12-28 01:58:34,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 01:58:34,442 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:34,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:58:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2021-12-28 01:58:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2021-12-28 01:58:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-28 01:58:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2021-12-28 01:58:34,564 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2021-12-28 01:58:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:34,565 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2021-12-28 01:58:34,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2021-12-28 01:58:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-28 01:58:34,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:34,567 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:34,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:34,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-28 01:58:34,784 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2021-12-28 01:58:34,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:34,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626649805] [2021-12-28 01:58:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:34,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 01:58:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-28 01:58:34,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:34,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626649805] [2021-12-28 01:58:34,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626649805] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:58:34,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897104933] [2021-12-28 01:58:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:34,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:58:34,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:58:34,884 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:58:34,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-28 01:58:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:34,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:58:34,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:58:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-28 01:58:35,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:58:35,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897104933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:35,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:58:35,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-28 01:58:35,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145552519] [2021-12-28 01:58:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:35,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:58:35,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:58:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:58:35,171 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:35,317 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2021-12-28 01:58:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:58:35,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-28 01:58:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:35,325 INFO L225 Difference]: With dead ends: 4365 [2021-12-28 01:58:35,325 INFO L226 Difference]: Without dead ends: 3262 [2021-12-28 01:58:35,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 01:58:35,328 INFO L933 BasicCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:35,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:58:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2021-12-28 01:58:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2021-12-28 01:58:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-28 01:58:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2021-12-28 01:58:35,438 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2021-12-28 01:58:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:35,439 INFO L470 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2021-12-28 01:58:35,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2021-12-28 01:58:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-28 01:58:35,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:35,442 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:35,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-28 01:58:35,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-28 01:58:35,665 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2021-12-28 01:58:35,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108515859] [2021-12-28 01:58:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:35,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 01:58:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-28 01:58:35,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108515859] [2021-12-28 01:58:35,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108515859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:35,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:58:35,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:58:35,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135058183] [2021-12-28 01:58:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:35,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:58:35,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:58:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:58:35,779 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 01:58:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:36,335 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2021-12-28 01:58:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 01:58:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-28 01:58:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:36,346 INFO L225 Difference]: With dead ends: 4206 [2021-12-28 01:58:36,347 INFO L226 Difference]: Without dead ends: 4203 [2021-12-28 01:58:36,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:58:36,350 INFO L933 BasicCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12174 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16346 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:36,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4467 Valid, 16346 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:58:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2021-12-28 01:58:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2021-12-28 01:58:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-28 01:58:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2021-12-28 01:58:36,525 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2021-12-28 01:58:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:36,525 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2021-12-28 01:58:36,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 01:58:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2021-12-28 01:58:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-28 01:58:36,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:36,529 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:36,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 01:58:36,529 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2021-12-28 01:58:36,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811327609] [2021-12-28 01:58:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:36,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:58:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 01:58:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:58:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:58:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:58:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:58:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:58:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:58:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:58:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 01:58:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:58:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-28 01:58:36,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:58:36,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811327609] [2021-12-28 01:58:36,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811327609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:58:36,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:58:36,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 01:58:36,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096991234] [2021-12-28 01:58:36,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:58:36,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:58:36,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:58:36,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:58:36,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:58:36,602 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:58:36,978 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2021-12-28 01:58:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:58:36,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-28 01:58:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:58:36,988 INFO L225 Difference]: With dead ends: 4845 [2021-12-28 01:58:36,988 INFO L226 Difference]: Without dead ends: 3985 [2021-12-28 01:58:36,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:58:36,992 INFO L933 BasicCegarLoop]: 4150 mSDtfsCounter, 142 mSDsluCounter, 12149 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 16299 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:58:36,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 16299 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 01:58:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2021-12-28 01:58:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2021-12-28 01:58:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-28 01:58:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2021-12-28 01:58:37,117 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2021-12-28 01:58:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:58:37,118 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2021-12-28 01:58:37,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:58:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2021-12-28 01:58:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-28 01:58:37,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:58:37,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:37,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 01:58:37,121 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:58:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:58:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2021-12-28 01:58:37,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:58:37,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768008641] [2021-12-28 01:58:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:58:37,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:58:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:58:37,134 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 01:58:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:58:37,188 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 01:58:37,188 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 01:58:37,189 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-28 01:58:37,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-28 01:58:37,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 01:58:37,193 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:58:37,196 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 01:58:37,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:58:37 BoogieIcfgContainer [2021-12-28 01:58:37,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 01:58:37,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 01:58:37,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 01:58:37,315 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 01:58:37,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:58:21" (3/4) ... [2021-12-28 01:58:37,317 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 01:58:37,411 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 01:58:37,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 01:58:37,412 INFO L158 Benchmark]: Toolchain (without parser) took 26341.06ms. Allocated memory was 73.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 40.3MB in the beginning and 772.0MB in the end (delta: -731.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-12-28 01:58:37,413 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:58:37,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3447.89ms. Allocated memory was 73.4MB in the beginning and 155.2MB in the end (delta: 81.8MB). Free memory was 39.9MB in the beginning and 65.0MB in the end (delta: -25.1MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2021-12-28 01:58:37,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 532.19ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 65.0MB in the beginning and 171.2MB in the end (delta: -106.3MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2021-12-28 01:58:37,414 INFO L158 Benchmark]: Boogie Preprocessor took 467.72ms. Allocated memory is still 310.4MB. Free memory was 171.2MB in the beginning and 147.2MB in the end (delta: 24.1MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2021-12-28 01:58:37,414 INFO L158 Benchmark]: RCFGBuilder took 5953.86ms. Allocated memory was 310.4MB in the beginning and 679.5MB in the end (delta: 369.1MB). Free memory was 147.2MB in the beginning and 215.8MB in the end (delta: -68.7MB). Peak memory consumption was 313.3MB. Max. memory is 16.1GB. [2021-12-28 01:58:37,414 INFO L158 Benchmark]: TraceAbstraction took 15836.75ms. Allocated memory was 679.5MB in the beginning and 1.8GB in the end (delta: 1.1GB). Free memory was 215.8MB in the beginning and 792.1MB in the end (delta: -576.2MB). Peak memory consumption was 559.4MB. Max. memory is 16.1GB. [2021-12-28 01:58:37,415 INFO L158 Benchmark]: Witness Printer took 96.99ms. Allocated memory is still 1.8GB. Free memory was 792.1MB in the beginning and 772.0MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-28 01:58:37,420 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.20ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3447.89ms. Allocated memory was 73.4MB in the beginning and 155.2MB in the end (delta: 81.8MB). Free memory was 39.9MB in the beginning and 65.0MB in the end (delta: -25.1MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 532.19ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 65.0MB in the beginning and 171.2MB in the end (delta: -106.3MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 467.72ms. Allocated memory is still 310.4MB. Free memory was 171.2MB in the beginning and 147.2MB in the end (delta: 24.1MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * RCFGBuilder took 5953.86ms. Allocated memory was 310.4MB in the beginning and 679.5MB in the end (delta: 369.1MB). Free memory was 147.2MB in the beginning and 215.8MB in the end (delta: -68.7MB). Peak memory consumption was 313.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15836.75ms. Allocated memory was 679.5MB in the beginning and 1.8GB in the end (delta: 1.1GB). Free memory was 215.8MB in the beginning and 792.1MB in the end (delta: -576.2MB). Peak memory consumption was 559.4MB. Max. memory is 16.1GB. * Witness Printer took 96.99ms. Allocated memory is still 1.8GB. Free memory was 792.1MB in the beginning and 772.0MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11586] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11424] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11429] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11434] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11439] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11588] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11301] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11320] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11589] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11452] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11457] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11462] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11467] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11590] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11593] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, 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] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, 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] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11208] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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=0, token=0] [L11214] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, 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=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, 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=0] [L11256] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, 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=0] [L11272] token += 1 [L11273] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, 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=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, 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=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, 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=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, 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=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, 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=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, 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=1] [L11301] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, 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=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11133]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46867 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46759 mSDsluCounter, 213808 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147255 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3724 IncrementalHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 66553 mSDtfsCounter, 3724 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1460 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6635occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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! [2021-12-28 01:58:37,469 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE