./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_label49+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 eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 15:49:03,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 15:49:03,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 15:49:03,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 15:49:03,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 15:49:03,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 15:49:03,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 15:49:03,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 15:49:03,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 15:49:03,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 15:49:03,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 15:49:03,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 15:49:03,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 15:49:03,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 15:49:03,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 15:49:03,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 15:49:03,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 15:49:03,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 15:49:03,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 15:49:03,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 15:49:03,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 15:49:03,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 15:49:03,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 15:49:03,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 15:49:03,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 15:49:03,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 15:49:03,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 15:49:03,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 15:49:03,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 15:49:03,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 15:49:03,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 15:49:03,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 15:49:03,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 15:49:03,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 15:49:03,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 15:49:03,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 15:49:03,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 15:49:03,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 15:49:03,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 15:49:03,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 15:49:03,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 15:49:03,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 15:49:03,211 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 15:49:03,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 15:49:03,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 15:49:03,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 15:49:03,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 15:49:03,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 15:49:03,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 15:49:03,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 15:49:03,222 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 15:49:03,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 15:49:03,222 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 15:49:03,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 15:49:03,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 15:49:03,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 15:49:03,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 15:49:03,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 15:49:03,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 15:49:03,223 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 15:49:03,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 15:49:03,224 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 15:49:03,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 15:49:03,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 15:49:03,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 15:49:03,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 15:49:03,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:49:03,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 15:49:03,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 15:49:03,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 15:49:03,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 15:49:03,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 15:49:03,227 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 15:49:03,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 15:49:03,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 15:49:03,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 15:49:03,228 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 -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2021-12-14 15:49:03,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 15:49:03,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 15:49:03,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 15:49:03,462 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 15:49:03,462 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 15:49:03,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2021-12-14 15:49:03,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfde2796/f6e181e6eb6f41d3b34c4b2377df869d/FLAG58f55c8bd [2021-12-14 15:49:04,350 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 15:49:04,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2021-12-14 15:49:04,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfde2796/f6e181e6eb6f41d3b34c4b2377df869d/FLAG58f55c8bd [2021-12-14 15:49:04,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfde2796/f6e181e6eb6f41d3b34c4b2377df869d [2021-12-14 15:49:04,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 15:49:04,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 15:49:04,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 15:49:04,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 15:49:04,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 15:49:04,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:49:04" (1/1) ... [2021-12-14 15:49:04,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2c5a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:04, skipping insertion in model container [2021-12-14 15:49:04,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:49:04" (1/1) ... [2021-12-14 15:49:04,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 15:49:04,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 15:49:06,419 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_label49+token_ring.01.cil-2.c[380593,380606] [2021-12-14 15:49:06,444 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_label49+token_ring.01.cil-2.c[383339,383352] [2021-12-14 15:49:06,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:49:06,580 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 15:49:07,333 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_label49+token_ring.01.cil-2.c[380593,380606] [2021-12-14 15:49:07,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_label49+token_ring.01.cil-2.c[383339,383352] [2021-12-14 15:49:07,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:49:07,407 INFO L208 MainTranslator]: Completed translation [2021-12-14 15:49:07,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07 WrapperNode [2021-12-14 15:49:07,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 15:49:07,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 15:49:07,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 15:49:07,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 15:49:07,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:07,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:07,854 INFO L137 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2021-12-14 15:49:07,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 15:49:07,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 15:49:07,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 15:49:07,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 15:49:07,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:07,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:07,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:07,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:08,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:08,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:08,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:08,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 15:49:08,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 15:49:08,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 15:49:08,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 15:49:08,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (1/1) ... [2021-12-14 15:49:08,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:49:08,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:08,473 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-14 15:49:08,536 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-14 15:49:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 15:49:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-14 15:49:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-14 15:49:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-14 15:49:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-14 15:49:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-14 15:49:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-14 15:49:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 15:49:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 15:49:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-14 15:49:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-14 15:49:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-14 15:49:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-14 15:49:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 15:49:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-14 15:49:08,587 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-14 15:49:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 15:49:08,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 15:49:08,684 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 15:49:08,700 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 15:49:14,543 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 15:49:14,571 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 15:49:14,572 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 15:49:14,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:49:14 BoogieIcfgContainer [2021-12-14 15:49:14,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 15:49:14,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 15:49:14,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 15:49:14,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 15:49:14,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:49:04" (1/3) ... [2021-12-14 15:49:14,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc2f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:49:14, skipping insertion in model container [2021-12-14 15:49:14,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:49:07" (2/3) ... [2021-12-14 15:49:14,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc2f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:49:14, skipping insertion in model container [2021-12-14 15:49:14,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:49:14" (3/3) ... [2021-12-14 15:49:14,585 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2021-12-14 15:49:14,590 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 15:49:14,590 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 15:49:14,639 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 15:49:14,646 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-14 15:49:14,646 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 15:49:14,707 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-14 15:49:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:49:14,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:14,716 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-14 15:49:14,717 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2021-12-14 15:49:14,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015871606] [2021-12-14 15:49:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:14,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:15,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:15,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:15,052 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-14 15:49:15,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:15,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015871606] [2021-12-14 15:49:15,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015871606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:15,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:49:15,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:49:15,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425496594] [2021-12-14 15:49:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:15,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:49:15,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:49:15,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:49:15,103 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-14 15:49:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:15,870 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2021-12-14 15:49:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:49:15,873 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-14 15:49:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:15,902 INFO L225 Difference]: With dead ends: 4727 [2021-12-14 15:49:15,903 INFO L226 Difference]: Without dead ends: 2368 [2021-12-14 15:49:15,913 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-14 15:49:15,916 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12409 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16608 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:15,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4337 Valid, 16608 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:49:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-12-14 15:49:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2021-12-14 15:49:16,036 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-14 15:49:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2021-12-14 15:49:16,048 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2021-12-14 15:49:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:16,048 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2021-12-14 15:49:16,049 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-14 15:49:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2021-12-14 15:49:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:49:16,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:16,052 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-14 15:49:16,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 15:49:16,053 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2021-12-14 15:49:16,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:16,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357780853] [2021-12-14 15:49:16,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:16,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,168 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-14 15:49:16,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:16,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357780853] [2021-12-14 15:49:16,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357780853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:16,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:49:16,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:49:16,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150896194] [2021-12-14 15:49:16,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:16,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:49:16,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:49:16,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:49:16,172 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-14 15:49:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:16,639 INFO L93 Difference]: Finished difference Result 2561 states and 4601 transitions. [2021-12-14 15:49:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 15:49:16,640 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-14 15:49:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:16,655 INFO L225 Difference]: With dead ends: 2561 [2021-12-14 15:49:16,656 INFO L226 Difference]: Without dead ends: 2366 [2021-12-14 15:49:16,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:49:16,662 INFO L933 BasicCegarLoop]: 4096 mSDtfsCounter, 4187 mSDsluCounter, 16100 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 20196 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:16,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4196 Valid, 20196 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 15:49:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-12-14 15:49:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2325. [2021-12-14 15:49:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.8374945247481385) internal successors, (4195), 2287 states have internal predecessors, (4195), 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-14 15:49:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4250 transitions. [2021-12-14 15:49:16,731 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4250 transitions. Word has length 58 [2021-12-14 15:49:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:16,732 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4250 transitions. [2021-12-14 15:49:16,732 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-14 15:49:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4250 transitions. [2021-12-14 15:49:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:49:16,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:16,738 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-14 15:49:16,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 15:49:16,739 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2021-12-14 15:49:16,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:16,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211899436] [2021-12-14 15:49:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:16,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:16,878 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-14 15:49:16,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:16,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211899436] [2021-12-14 15:49:16,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211899436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:16,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:49:16,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:49:16,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841855413] [2021-12-14 15:49:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:16,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:49:16,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:49:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:49:16,882 INFO L87 Difference]: Start difference. First operand 2325 states and 4250 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-14 15:49:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:17,535 INFO L93 Difference]: Finished difference Result 2695 states and 4778 transitions. [2021-12-14 15:49:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:49:17,535 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-14 15:49:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:17,547 INFO L225 Difference]: With dead ends: 2695 [2021-12-14 15:49:17,548 INFO L226 Difference]: Without dead ends: 2500 [2021-12-14 15:49:17,552 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-14 15:49:17,556 INFO L933 BasicCegarLoop]: 4192 mSDtfsCounter, 4293 mSDsluCounter, 16408 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4303 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:17,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4303 Valid, 20600 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:49:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2021-12-14 15:49:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2412. [2021-12-14 15:49:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 2354 states have (on average 1.8254035683942227) internal successors, (4297), 2359 states have internal predecessors, (4297), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (39), 35 states have call predecessors, (39), 34 states have call successors, (39) [2021-12-14 15:49:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 4372 transitions. [2021-12-14 15:49:17,631 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 4372 transitions. Word has length 58 [2021-12-14 15:49:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:17,631 INFO L470 AbstractCegarLoop]: Abstraction has 2412 states and 4372 transitions. [2021-12-14 15:49:17,632 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-14 15:49:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 4372 transitions. [2021-12-14 15:49:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:49:17,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:17,633 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-14 15:49:17,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 15:49:17,634 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2021-12-14 15:49:17,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:17,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967055862] [2021-12-14 15:49:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:17,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:17,732 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-14 15:49:17,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:17,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967055862] [2021-12-14 15:49:17,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967055862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:17,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:49:17,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:49:17,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509852653] [2021-12-14 15:49:17,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:17,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:49:17,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:49:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:49:17,739 INFO L87 Difference]: Start difference. First operand 2412 states and 4372 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-14 15:49:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:18,398 INFO L93 Difference]: Finished difference Result 2976 states and 5174 transitions. [2021-12-14 15:49:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:49:18,399 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-14 15:49:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:18,413 INFO L225 Difference]: With dead ends: 2976 [2021-12-14 15:49:18,416 INFO L226 Difference]: Without dead ends: 2694 [2021-12-14 15:49:18,420 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-14 15:49:18,425 INFO L933 BasicCegarLoop]: 4196 mSDtfsCounter, 4237 mSDsluCounter, 16401 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 20597 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:18,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4244 Valid, 20597 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:49:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2021-12-14 15:49:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2562. [2021-12-14 15:49:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2475 states have (on average 1.804040404040404) internal successors, (4465), 2482 states have internal predecessors, (4465), 52 states have call successors, (52), 30 states have call predecessors, (52), 33 states have return successors, (63), 53 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-14 15:49:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 4580 transitions. [2021-12-14 15:49:18,500 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 4580 transitions. Word has length 58 [2021-12-14 15:49:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:18,507 INFO L470 AbstractCegarLoop]: Abstraction has 2562 states and 4580 transitions. [2021-12-14 15:49:18,507 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-14 15:49:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 4580 transitions. [2021-12-14 15:49:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:49:18,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:18,511 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-14 15:49:18,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 15:49:18,512 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:18,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2021-12-14 15:49:18,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:18,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316755854] [2021-12-14 15:49:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:18,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:18,577 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-14 15:49:18,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:18,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316755854] [2021-12-14 15:49:18,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316755854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:18,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:49:18,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:49:18,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616884452] [2021-12-14 15:49:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:18,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:49:18,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:49:18,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:49:18,579 INFO L87 Difference]: Start difference. First operand 2562 states and 4580 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-14 15:49:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:19,106 INFO L93 Difference]: Finished difference Result 3365 states and 5721 transitions. [2021-12-14 15:49:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:49:19,107 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-14 15:49:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:19,120 INFO L225 Difference]: With dead ends: 3365 [2021-12-14 15:49:19,120 INFO L226 Difference]: Without dead ends: 2934 [2021-12-14 15:49:19,123 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-14 15:49:19,124 INFO L933 BasicCegarLoop]: 4222 mSDtfsCounter, 4352 mSDsluCounter, 12196 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4375 SdHoareTripleChecker+Valid, 16418 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:19,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4375 Valid, 16418 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:49:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2021-12-14 15:49:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2807. [2021-12-14 15:49:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2670 states have (on average 1.7704119850187265) internal successors, (4727), 2682 states have internal predecessors, (4727), 82 states have call successors, (82), 48 states have call predecessors, (82), 53 states have return successors, (97), 80 states have call predecessors, (97), 80 states have call successors, (97) [2021-12-14 15:49:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 4906 transitions. [2021-12-14 15:49:19,216 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 4906 transitions. Word has length 58 [2021-12-14 15:49:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:19,216 INFO L470 AbstractCegarLoop]: Abstraction has 2807 states and 4906 transitions. [2021-12-14 15:49:19,216 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-14 15:49:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 4906 transitions. [2021-12-14 15:49:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 15:49:19,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:19,218 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-14 15:49:19,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 15:49:19,219 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2021-12-14 15:49:19,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:19,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462453072] [2021-12-14 15:49:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:19,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 15:49:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 15:49:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,420 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-14 15:49:19,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:19,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462453072] [2021-12-14 15:49:19,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462453072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:19,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905933910] [2021-12-14 15:49:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:19,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:19,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:19,423 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-14 15:49:19,443 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-14 15:49:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:19,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:49:19,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:19,691 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-14 15:49:19,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:19,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905933910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:19,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:19,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:49:19,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172952758] [2021-12-14 15:49:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:19,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:49:19,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:19,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:49:19,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:49:19,693 INFO L87 Difference]: Start difference. First operand 2807 states and 4906 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-14 15:49:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:19,773 INFO L93 Difference]: Finished difference Result 4093 states and 6716 transitions. [2021-12-14 15:49:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:49:19,773 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-14 15:49:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:19,787 INFO L225 Difference]: With dead ends: 4093 [2021-12-14 15:49:19,787 INFO L226 Difference]: Without dead ends: 3418 [2021-12-14 15:49:19,790 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-14 15:49:19,791 INFO L933 BasicCegarLoop]: 4226 mSDtfsCounter, 113 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 8333 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-14 15:49:19,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 8333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:49:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2021-12-14 15:49:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3418. [2021-12-14 15:49:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 3159 states have (on average 1.7059195948084838) internal successors, (5389), 3178 states have internal predecessors, (5389), 153 states have call successors, (153), 93 states have call predecessors, (153), 104 states have return successors, (206), 154 states have call predecessors, (206), 151 states have call successors, (206) [2021-12-14 15:49:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 5748 transitions. [2021-12-14 15:49:19,897 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 5748 transitions. Word has length 93 [2021-12-14 15:49:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:19,901 INFO L470 AbstractCegarLoop]: Abstraction has 3418 states and 5748 transitions. [2021-12-14 15:49:19,901 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-14 15:49:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 5748 transitions. [2021-12-14 15:49:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-14 15:49:19,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:19,908 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-14 15:49:19,936 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-14 15:49:20,131 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-14 15:49:20,131 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2021-12-14 15:49:20,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:20,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331609422] [2021-12-14 15:49:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:20,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 15:49:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 15:49:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-14 15:49:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,293 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-14 15:49:20,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:20,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331609422] [2021-12-14 15:49:20,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331609422] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:20,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650398739] [2021-12-14 15:49:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:20,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:20,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:20,295 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-14 15:49:20,296 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-14 15:49:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:20,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:49:20,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:20,631 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-14 15:49:20,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:20,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650398739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:20,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:20,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 15:49:20,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047573618] [2021-12-14 15:49:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:20,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:49:20,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:20,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:49:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:49:20,634 INFO L87 Difference]: Start difference. First operand 3418 states and 5748 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-14 15:49:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:20,736 INFO L93 Difference]: Finished difference Result 5902 states and 9201 transitions. [2021-12-14 15:49:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:49:20,736 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-14 15:49:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:20,756 INFO L225 Difference]: With dead ends: 5902 [2021-12-14 15:49:20,756 INFO L226 Difference]: Without dead ends: 4619 [2021-12-14 15:49:20,761 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-14 15:49:20,762 INFO L933 BasicCegarLoop]: 4140 mSDtfsCounter, 4037 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4037 SdHoareTripleChecker+Valid, 4271 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-14 15:49:20,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4037 Valid, 4271 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:49:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2021-12-14 15:49:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4583. [2021-12-14 15:49:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4098 states have (on average 1.6273792093704247) internal successors, (6669), 4132 states have internal predecessors, (6669), 281 states have call successors, (281), 179 states have call predecessors, (281), 202 states have return successors, (372), 279 states have call predecessors, (372), 279 states have call successors, (372) [2021-12-14 15:49:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 7322 transitions. [2021-12-14 15:49:20,907 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 7322 transitions. Word has length 119 [2021-12-14 15:49:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:20,908 INFO L470 AbstractCegarLoop]: Abstraction has 4583 states and 7322 transitions. [2021-12-14 15:49:20,908 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-14 15:49:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 7322 transitions. [2021-12-14 15:49:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 15:49:20,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:20,914 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-14 15:49:20,941 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-14 15:49:21,127 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-14 15:49:21,128 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2021-12-14 15:49:21,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:21,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418663678] [2021-12-14 15:49:21,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:21,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 15:49:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:49:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 15:49:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 15:49:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,244 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-14 15:49:21,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:21,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418663678] [2021-12-14 15:49:21,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418663678] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:21,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038534534] [2021-12-14 15:49:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:21,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:21,247 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-14 15:49:21,274 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-14 15:49:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:21,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:49:21,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:21,578 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-14 15:49:21,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:21,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038534534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:21,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:21,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:49:21,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141298417] [2021-12-14 15:49:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:21,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:49:21,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:49:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:49:21,580 INFO L87 Difference]: Start difference. First operand 4583 states and 7322 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-14 15:49:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:21,693 INFO L93 Difference]: Finished difference Result 6517 states and 9983 transitions. [2021-12-14 15:49:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:49:21,694 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-14 15:49:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:21,713 INFO L225 Difference]: With dead ends: 6517 [2021-12-14 15:49:21,714 INFO L226 Difference]: Without dead ends: 4781 [2021-12-14 15:49:21,719 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-14 15:49:21,720 INFO L933 BasicCegarLoop]: 4131 mSDtfsCounter, 4058 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 4270 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-14 15:49:21,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4058 Valid, 4270 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:49:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2021-12-14 15:49:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4759. [2021-12-14 15:49:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4254 states have (on average 1.6043723554301834) internal successors, (6825), 4288 states have internal predecessors, (6825), 285 states have call successors, (285), 195 states have call predecessors, (285), 218 states have return successors, (392), 283 states have call predecessors, (392), 283 states have call successors, (392) [2021-12-14 15:49:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 7502 transitions. [2021-12-14 15:49:21,864 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 7502 transitions. Word has length 135 [2021-12-14 15:49:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:21,865 INFO L470 AbstractCegarLoop]: Abstraction has 4759 states and 7502 transitions. [2021-12-14 15:49:21,866 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-14 15:49:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 7502 transitions. [2021-12-14 15:49:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 15:49:21,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:21,872 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-14 15:49:21,903 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-14 15:49:22,087 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-14 15:49:22,088 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2021-12-14 15:49:22,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:22,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880496440] [2021-12-14 15:49:22,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:22,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 15:49:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,238 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-14 15:49:22,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:22,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880496440] [2021-12-14 15:49:22,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880496440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:22,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284616393] [2021-12-14 15:49:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:22,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:22,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:22,240 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-14 15:49:22,266 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-14 15:49:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:22,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:49:22,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:22,554 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-14 15:49:22,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:22,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284616393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:22,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:22,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:49:22,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559736970] [2021-12-14 15:49:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:22,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:49:22,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:49:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:49:22,557 INFO L87 Difference]: Start difference. First operand 4759 states and 7502 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-14 15:49:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:22,668 INFO L93 Difference]: Finished difference Result 6161 states and 9471 transitions. [2021-12-14 15:49:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:49:22,668 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-14 15:49:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:22,685 INFO L225 Difference]: With dead ends: 6161 [2021-12-14 15:49:22,685 INFO L226 Difference]: Without dead ends: 4783 [2021-12-14 15:49:22,692 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-14 15:49:22,693 INFO L933 BasicCegarLoop]: 4215 mSDtfsCounter, 110 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 8313 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-14 15:49:22,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 8313 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:49:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2021-12-14 15:49:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4747. [2021-12-14 15:49:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 4242 states have (on average 1.5933521923620932) internal successors, (6759), 4276 states have internal predecessors, (6759), 285 states have call successors, (285), 195 states have call predecessors, (285), 218 states have return successors, (392), 283 states have call predecessors, (392), 283 states have call successors, (392) [2021-12-14 15:49:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 7436 transitions. [2021-12-14 15:49:22,843 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 7436 transitions. Word has length 136 [2021-12-14 15:49:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:22,844 INFO L470 AbstractCegarLoop]: Abstraction has 4747 states and 7436 transitions. [2021-12-14 15:49:22,844 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-14 15:49:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 7436 transitions. [2021-12-14 15:49:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 15:49:22,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:22,850 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-14 15:49:22,877 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-14 15:49:23,063 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-14 15:49:23,064 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2021-12-14 15:49:23,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:23,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113291677] [2021-12-14 15:49:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:23,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 15:49:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,184 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-14 15:49:23,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113291677] [2021-12-14 15:49:23,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113291677] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169430306] [2021-12-14 15:49:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:23,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:23,187 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-14 15:49:23,188 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-14 15:49:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:23,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:49:23,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:23,499 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-14 15:49:23,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:23,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169430306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:23,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:23,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:49:23,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941216096] [2021-12-14 15:49:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:23,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:49:23,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:49:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:49:23,502 INFO L87 Difference]: Start difference. First operand 4747 states and 7436 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-14 15:49:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:23,609 INFO L93 Difference]: Finished difference Result 6943 states and 10430 transitions. [2021-12-14 15:49:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:49:23,609 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-14 15:49:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:23,633 INFO L225 Difference]: With dead ends: 6943 [2021-12-14 15:49:23,633 INFO L226 Difference]: Without dead ends: 4593 [2021-12-14 15:49:23,640 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-14 15:49:23,641 INFO L933 BasicCegarLoop]: 4111 mSDtfsCounter, 4088 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4088 SdHoareTripleChecker+Valid, 4135 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-14 15:49:23,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4088 Valid, 4135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:49:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2021-12-14 15:49:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4455. [2021-12-14 15:49:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 4006 states have (on average 1.5848726909635547) internal successors, (6349), 4032 states have internal predecessors, (6349), 257 states have call successors, (257), 175 states have call predecessors, (257), 190 states have return successors, (310), 251 states have call predecessors, (310), 255 states have call successors, (310) [2021-12-14 15:49:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6916 transitions. [2021-12-14 15:49:23,768 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6916 transitions. Word has length 136 [2021-12-14 15:49:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:23,769 INFO L470 AbstractCegarLoop]: Abstraction has 4455 states and 6916 transitions. [2021-12-14 15:49:23,769 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-14 15:49:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6916 transitions. [2021-12-14 15:49:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:49:23,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:23,774 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-14 15:49:23,801 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-14 15:49:23,987 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-14 15:49:23,987 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:23,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:23,988 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2021-12-14 15:49:23,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:23,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653836000] [2021-12-14 15:49:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:23,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:49:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,090 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-14 15:49:24,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:24,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653836000] [2021-12-14 15:49:24,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653836000] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:24,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925043018] [2021-12-14 15:49:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:24,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:24,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:24,092 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-14 15:49:24,093 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-14 15:49:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:24,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 15:49:24,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:24,407 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-14 15:49:24,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:24,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925043018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:24,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:24,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 15:49:24,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565243858] [2021-12-14 15:49:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:24,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:49:24,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:49:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 15:49:24,411 INFO L87 Difference]: Start difference. First operand 4455 states and 6916 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-14 15:49:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:24,722 INFO L93 Difference]: Finished difference Result 6765 states and 9877 transitions. [2021-12-14 15:49:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 15:49:24,723 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-14 15:49:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:24,737 INFO L225 Difference]: With dead ends: 6765 [2021-12-14 15:49:24,737 INFO L226 Difference]: Without dead ends: 4447 [2021-12-14 15:49:24,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:49:24,744 INFO L933 BasicCegarLoop]: 4090 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12161 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:24,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4115 Valid, 12161 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:49:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2021-12-14 15:49:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4447. [2021-12-14 15:49:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4447 states, 3998 states have (on average 1.5710355177588795) internal successors, (6281), 4024 states have internal predecessors, (6281), 257 states have call successors, (257), 175 states have call predecessors, (257), 190 states have return successors, (310), 251 states have call predecessors, (310), 255 states have call successors, (310) [2021-12-14 15:49:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6848 transitions. [2021-12-14 15:49:24,919 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6848 transitions. Word has length 137 [2021-12-14 15:49:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:24,919 INFO L470 AbstractCegarLoop]: Abstraction has 4447 states and 6848 transitions. [2021-12-14 15:49:24,920 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-14 15:49:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6848 transitions. [2021-12-14 15:49:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:49:24,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:24,925 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-14 15:49:24,952 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-14 15:49:25,149 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-14 15:49:25,150 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2021-12-14 15:49:25,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417115390] [2021-12-14 15:49:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:25,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:49:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,254 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-14 15:49:25,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417115390] [2021-12-14 15:49:25,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417115390] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80545109] [2021-12-14 15:49:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:25,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:25,256 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-14 15:49:25,280 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-14 15:49:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:25,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 15:49:25,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:25,577 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-14 15:49:25,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:25,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80545109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:25,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:25,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 15:49:25,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413841138] [2021-12-14 15:49:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:25,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:49:25,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:25,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:49:25,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 15:49:25,580 INFO L87 Difference]: Start difference. First operand 4447 states and 6848 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-14 15:49:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:25,879 INFO L93 Difference]: Finished difference Result 6530 states and 9508 transitions. [2021-12-14 15:49:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:49:25,880 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-14 15:49:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:25,896 INFO L225 Difference]: With dead ends: 6530 [2021-12-14 15:49:25,896 INFO L226 Difference]: Without dead ends: 4511 [2021-12-14 15:49:25,904 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-14 15:49:25,905 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8068 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12170 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:25,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4136 Valid, 12170 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:49:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2021-12-14 15:49:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 3795. [2021-12-14 15:49:26,048 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-14 15:49:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2021-12-14 15:49:26,063 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2021-12-14 15:49:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:26,064 INFO L470 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2021-12-14 15:49:26,064 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-14 15:49:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2021-12-14 15:49:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:49:26,070 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:26,070 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-14 15:49:26,097 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-14 15:49:26,295 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-14 15:49:26,296 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2021-12-14 15:49:26,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:26,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558088569] [2021-12-14 15:49:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:26,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:49:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,428 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-14 15:49:26,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:26,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558088569] [2021-12-14 15:49:26,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558088569] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:26,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491094461] [2021-12-14 15:49:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:26,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:26,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:26,431 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-14 15:49:26,432 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-14 15:49:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:26,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:49:26,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:26,756 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-14 15:49:26,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:26,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491094461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:26,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:26,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:49:26,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249661642] [2021-12-14 15:49:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:26,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:49:26,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:49:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:49:26,758 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-14 15:49:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:26,916 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2021-12-14 15:49:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:49:26,916 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-14 15:49:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:26,927 INFO L225 Difference]: With dead ends: 4934 [2021-12-14 15:49:26,927 INFO L226 Difference]: Without dead ends: 3270 [2021-12-14 15:49:26,932 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-14 15:49:26,933 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-14 15:49:26,933 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-14 15:49:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2021-12-14 15:49:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2021-12-14 15:49:27,037 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-14 15:49:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2021-12-14 15:49:27,047 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2021-12-14 15:49:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:27,048 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2021-12-14 15:49:27,048 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-14 15:49:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2021-12-14 15:49:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:49:27,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:27,051 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-14 15:49:27,080 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-14 15:49:27,275 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-14 15:49:27,276 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2021-12-14 15:49:27,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:27,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911616563] [2021-12-14 15:49:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:27,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:49:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,374 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-14 15:49:27,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911616563] [2021-12-14 15:49:27,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911616563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:49:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670587721] [2021-12-14 15:49:27,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:27,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:49:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:49:27,376 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-14 15:49:27,377 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-14 15:49:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:27,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:49:27,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:49:27,694 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-14 15:49:27,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:49:27,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670587721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:27,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:49:27,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:49:27,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268799968] [2021-12-14 15:49:27,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:27,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:49:27,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:27,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:49:27,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:49:27,697 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-14 15:49:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:27,829 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2021-12-14 15:49:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:49:27,829 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-14 15:49:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:27,837 INFO L225 Difference]: With dead ends: 4365 [2021-12-14 15:49:27,837 INFO L226 Difference]: Without dead ends: 3262 [2021-12-14 15:49:27,843 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-14 15:49:27,843 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-14 15:49:27,844 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-14 15:49:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2021-12-14 15:49:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2021-12-14 15:49:27,948 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-14 15:49:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2021-12-14 15:49:27,957 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2021-12-14 15:49:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:27,957 INFO L470 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2021-12-14 15:49:27,958 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-14 15:49:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2021-12-14 15:49:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:49:27,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:27,961 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-14 15:49:27,988 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-14 15:49:28,176 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-14 15:49:28,177 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:28,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2021-12-14 15:49:28,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:28,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415245616] [2021-12-14 15:49:28,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:28,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:49:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:28,321 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-14 15:49:28,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:28,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415245616] [2021-12-14 15:49:28,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415245616] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:28,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:49:28,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:49:28,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912091075] [2021-12-14 15:49:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:28,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:49:28,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:49:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:49:28,325 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-14 15:49:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:28,863 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2021-12-14 15:49:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 15:49:28,864 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-14 15:49:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:28,874 INFO L225 Difference]: With dead ends: 4206 [2021-12-14 15:49:28,874 INFO L226 Difference]: Without dead ends: 4203 [2021-12-14 15:49:28,876 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-14 15:49:28,876 INFO L933 BasicCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12192 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16364 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:28,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4467 Valid, 16364 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 15:49:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2021-12-14 15:49:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2021-12-14 15:49:28,983 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-14 15:49:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2021-12-14 15:49:28,993 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2021-12-14 15:49:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:28,993 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2021-12-14 15:49:28,993 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-14 15:49:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2021-12-14 15:49:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-14 15:49:28,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:28,996 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-14 15:49:28,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 15:49:28,997 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2021-12-14 15:49:28,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:28,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119237667] [2021-12-14 15:49:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:28,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:49:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:49:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:49:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:49:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:49:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:49:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:49:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:49:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:49:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:49:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:49:29,071 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-14 15:49:29,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:49:29,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119237667] [2021-12-14 15:49:29,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119237667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:49:29,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:49:29,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:49:29,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907264862] [2021-12-14 15:49:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:49:29,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:49:29,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:49:29,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:49:29,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:49:29,073 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-14 15:49:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:49:29,439 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2021-12-14 15:49:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:49:29,440 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-14 15:49:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:49:29,451 INFO L225 Difference]: With dead ends: 4845 [2021-12-14 15:49:29,451 INFO L226 Difference]: Without dead ends: 3985 [2021-12-14 15:49:29,455 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-14 15:49:29,455 INFO L933 BasicCegarLoop]: 4151 mSDtfsCounter, 142 mSDsluCounter, 12166 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 16317 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:49:29,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 16317 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:49:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2021-12-14 15:49:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2021-12-14 15:49:29,560 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-14 15:49:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2021-12-14 15:49:29,568 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2021-12-14 15:49:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:49:29,568 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2021-12-14 15:49:29,568 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-14 15:49:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2021-12-14 15:49:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-14 15:49:29,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:49:29,571 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-14 15:49:29,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 15:49:29,571 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:49:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:49:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2021-12-14 15:49:29,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:49:29,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559355645] [2021-12-14 15:49:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:49:29,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:49:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:49:29,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 15:49:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:49:29,651 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 15:49:29,652 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 15:49:29,652 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 15:49:29,654 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 15:49:29,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 15:49:29,657 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-14 15:49:29,661 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 15:49:29,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:49:29 BoogieIcfgContainer [2021-12-14 15:49:29,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 15:49:29,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 15:49:29,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 15:49:29,792 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 15:49:29,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:49:14" (3/4) ... [2021-12-14 15:49:29,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 15:49:29,904 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 15:49:29,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 15:49:29,906 INFO L158 Benchmark]: Toolchain (without parser) took 25356.01ms. Allocated memory was 111.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 76.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 357.2MB. Max. memory is 16.1GB. [2021-12-14 15:49:29,907 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 90.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 15:49:29,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2856.42ms. Allocated memory was 111.1MB in the beginning and 237.0MB in the end (delta: 125.8MB). Free memory was 76.4MB in the beginning and 123.3MB in the end (delta: -47.0MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2021-12-14 15:49:29,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 446.06ms. Allocated memory is still 237.0MB. Free memory was 123.3MB in the beginning and 90.6MB in the end (delta: 32.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2021-12-14 15:49:29,908 INFO L158 Benchmark]: Boogie Preprocessor took 527.10ms. Allocated memory is still 237.0MB. Free memory was 90.6MB in the beginning and 73.0MB in the end (delta: 17.6MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2021-12-14 15:49:29,908 INFO L158 Benchmark]: RCFGBuilder took 6193.47ms. Allocated memory was 237.0MB in the beginning and 853.5MB in the end (delta: 616.6MB). Free memory was 73.0MB in the beginning and 341.7MB in the end (delta: -268.7MB). Peak memory consumption was 348.6MB. Max. memory is 16.1GB. [2021-12-14 15:49:29,909 INFO L158 Benchmark]: TraceAbstraction took 15212.97ms. Allocated memory was 853.5MB in the beginning and 1.6GB in the end (delta: 719.3MB). Free memory was 340.6MB in the beginning and 1.2GB in the end (delta: -858.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 15:49:29,909 INFO L158 Benchmark]: Witness Printer took 112.76ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-14 15:49:29,913 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.12ms. Allocated memory is still 90.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2856.42ms. Allocated memory was 111.1MB in the beginning and 237.0MB in the end (delta: 125.8MB). Free memory was 76.4MB in the beginning and 123.3MB in the end (delta: -47.0MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 446.06ms. Allocated memory is still 237.0MB. Free memory was 123.3MB in the beginning and 90.6MB in the end (delta: 32.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 527.10ms. Allocated memory is still 237.0MB. Free memory was 90.6MB in the beginning and 73.0MB in the end (delta: 17.6MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * RCFGBuilder took 6193.47ms. Allocated memory was 237.0MB in the beginning and 853.5MB in the end (delta: 616.6MB). Free memory was 73.0MB in the beginning and 341.7MB in the end (delta: -268.7MB). Peak memory consumption was 348.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15212.97ms. Allocated memory was 853.5MB in the beginning and 1.6GB in the end (delta: 719.3MB). Free memory was 340.6MB in the beginning and 1.2GB in the end (delta: -858.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 112.76ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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=-2, tmp_ndt_2=-3, 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=-2, tmp_ndt_2=-3, 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=-2, tmp_ndt_2=-3, 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: 11094]: 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.0s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46791 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46683 mSDsluCounter, 213573 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147127 mSDsCounter, 535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3219 IncrementalHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 535 mSolverCounterUnsat, 66446 mSDtfsCounter, 3219 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1599 GetRequests, 1459 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4759occurred in iteration=8, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 2373 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4618 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-14 15:49:29,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- 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