./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.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_label42+token_ring.02.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 954b1f05390ccaafb1cee97c6b5216f4167723fe344c33082a0f73951b4d6f58 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 15:38:43,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 15:38:43,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 15:38:43,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 15:38:43,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 15:38:43,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 15:38:43,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 15:38:43,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 15:38:43,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 15:38:43,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 15:38:43,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 15:38:43,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 15:38:43,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 15:38:43,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 15:38:43,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 15:38:43,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 15:38:43,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 15:38:43,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 15:38:43,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 15:38:43,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 15:38:43,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 15:38:43,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 15:38:43,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 15:38:43,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 15:38:43,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 15:38:43,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 15:38:43,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 15:38:43,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 15:38:43,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 15:38:43,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 15:38:43,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 15:38:43,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 15:38:43,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 15:38:43,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 15:38:43,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 15:38:43,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 15:38:43,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 15:38:43,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 15:38:43,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 15:38:43,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 15:38:43,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 15:38:43,140 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:38:43,162 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 15:38:43,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 15:38:43,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 15:38:43,165 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 15:38:43,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 15:38:43,166 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 15:38:43,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 15:38:43,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 15:38:43,167 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 15:38:43,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 15:38:43,168 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 15:38:43,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 15:38:43,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 15:38:43,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 15:38:43,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 15:38:43,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 15:38:43,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 15:38:43,169 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 15:38:43,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 15:38:43,169 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 15:38:43,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 15:38:43,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 15:38:43,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 15:38:43,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 15:38:43,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:38:43,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 15:38:43,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 15:38:43,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 15:38:43,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 15:38:43,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 15:38:43,171 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 15:38:43,171 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 15:38:43,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 15:38:43,172 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 15:38:43,172 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 -> 954b1f05390ccaafb1cee97c6b5216f4167723fe344c33082a0f73951b4d6f58 [2021-12-14 15:38:43,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 15:38:43,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 15:38:43,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 15:38:43,396 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 15:38:43,397 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 15:38:43,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-2.c [2021-12-14 15:38:43,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252f54583/314260633b324591847c3ce696ac209c/FLAG5e4b9bfef [2021-12-14 15:38:44,111 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 15:38:44,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-2.c [2021-12-14 15:38:44,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252f54583/314260633b324591847c3ce696ac209c/FLAG5e4b9bfef [2021-12-14 15:38:44,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252f54583/314260633b324591847c3ce696ac209c [2021-12-14 15:38:44,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 15:38:44,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 15:38:44,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 15:38:44,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 15:38:44,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 15:38:44,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:38:44" (1/1) ... [2021-12-14 15:38:44,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19953d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:44, skipping insertion in model container [2021-12-14 15:38:44,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:38:44" (1/1) ... [2021-12-14 15:38:44,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 15:38:44,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 15:38:46,145 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_label42+token_ring.02.cil-2.c[378560,378573] [2021-12-14 15:38:46,169 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_label42+token_ring.02.cil-2.c[383339,383352] [2021-12-14 15:38:46,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:38:46,262 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 15:38:46,927 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_label42+token_ring.02.cil-2.c[378560,378573] [2021-12-14 15:38:46,934 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_label42+token_ring.02.cil-2.c[383339,383352] [2021-12-14 15:38:46,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:38:47,005 INFO L208 MainTranslator]: Completed translation [2021-12-14 15:38:47,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47 WrapperNode [2021-12-14 15:38:47,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 15:38:47,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 15:38:47,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 15:38:47,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 15:38:47,012 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:38:47" (1/1) ... [2021-12-14 15:38:47,078 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:38:47" (1/1) ... [2021-12-14 15:38:47,382 INFO L137 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12624 [2021-12-14 15:38:47,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 15:38:47,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 15:38:47,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 15:38:47,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 15:38:47,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 15:38:47,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 15:38:47,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 15:38:47,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 15:38:47,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (1/1) ... [2021-12-14 15:38:47,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:38:47,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:38:47,871 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:38:47,896 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:38:47,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 15:38:47,906 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-14 15:38:47,906 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-14 15:38:47,906 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-14 15:38:47,906 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-14 15:38:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-14 15:38:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-14 15:38:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 15:38:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 15:38:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-14 15:38:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-14 15:38:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-14 15:38:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-14 15:38:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 15:38:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-14 15:38:47,908 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-14 15:38:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 15:38:47,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 15:38:47,987 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 15:38:47,988 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 15:38:52,470 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 15:38:52,491 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 15:38:52,491 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 15:38:52,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:38:52 BoogieIcfgContainer [2021-12-14 15:38:52,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 15:38:52,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 15:38:52,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 15:38:52,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 15:38:52,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:38:44" (1/3) ... [2021-12-14 15:38:52,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fc7523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:38:52, skipping insertion in model container [2021-12-14 15:38:52,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:38:47" (2/3) ... [2021-12-14 15:38:52,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fc7523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:38:52, skipping insertion in model container [2021-12-14 15:38:52,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:38:52" (3/3) ... [2021-12-14 15:38:52,501 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.02.cil-2.c [2021-12-14 15:38:52,504 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 15:38:52,504 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 15:38:52,537 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 15:38:52,541 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 15:38:52,541 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 15:38:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 15:38:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:38:52,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:52,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:38:52,579 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2062992276, now seen corresponding path program 1 times [2021-12-14 15:38:52,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:52,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437189107] [2021-12-14 15:38:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:52,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:52,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:52,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:52,777 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:38:52,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:52,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437189107] [2021-12-14 15:38:52,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437189107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:52,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:38:52,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:38:52,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348566120] [2021-12-14 15:38:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:52,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:38:52,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:52,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:38:52,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:38:52,820 INFO L87 Difference]: Start difference. First operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:38:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:53,679 INFO L93 Difference]: Finished difference Result 4824 states and 8887 transitions. [2021-12-14 15:38:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:38:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2021-12-14 15:38:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:53,698 INFO L225 Difference]: With dead ends: 4824 [2021-12-14 15:38:53,698 INFO L226 Difference]: Without dead ends: 2441 [2021-12-14 15:38:53,704 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:38:53,707 INFO L933 BasicCegarLoop]: 4249 mSDtfsCounter, 4444 mSDsluCounter, 12475 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 16724 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 15:38:53,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4453 Valid, 16724 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 15:38:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2021-12-14 15:38:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2376. [2021-12-14 15:38:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-12-14 15:38:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4336 transitions. [2021-12-14 15:38:53,796 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4336 transitions. Word has length 69 [2021-12-14 15:38:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:38:53,796 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4336 transitions. [2021-12-14 15:38:53,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:38:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4336 transitions. [2021-12-14 15:38:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:38:53,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:53,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:38:53,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 15:38:53,800 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1960277912, now seen corresponding path program 1 times [2021-12-14 15:38:53,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:53,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393752634] [2021-12-14 15:38:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:53,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:53,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:53,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:53,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:53,974 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:38:53,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393752634] [2021-12-14 15:38:53,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393752634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:53,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:38:53,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:38:53,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520428928] [2021-12-14 15:38:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:53,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:38:53,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:38:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:38:53,977 INFO L87 Difference]: Start difference. First operand 2376 states and 4336 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:54,631 INFO L93 Difference]: Finished difference Result 2686 states and 4809 transitions. [2021-12-14 15:38:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 15:38:54,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-14 15:38:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:54,639 INFO L225 Difference]: With dead ends: 2686 [2021-12-14 15:38:54,640 INFO L226 Difference]: Without dead ends: 2441 [2021-12-14 15:38:54,641 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:38:54,656 INFO L933 BasicCegarLoop]: 4142 mSDtfsCounter, 4269 mSDsluCounter, 16164 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4279 SdHoareTripleChecker+Valid, 20306 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:38:54,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4279 Valid, 20306 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:38:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2021-12-14 15:38:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2376. [2021-12-14 15:38:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8331903945111492) internal successors, (4275), 2336 states have internal predecessors, (4275), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-12-14 15:38:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4334 transitions. [2021-12-14 15:38:54,741 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4334 transitions. Word has length 69 [2021-12-14 15:38:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:38:54,742 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4334 transitions. [2021-12-14 15:38:54,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4334 transitions. [2021-12-14 15:38:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:38:54,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:54,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:38:54,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 15:38:54,744 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:54,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash -573492502, now seen corresponding path program 1 times [2021-12-14 15:38:54,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:54,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888783266] [2021-12-14 15:38:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:54,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:54,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:54,869 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:38:54,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:54,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888783266] [2021-12-14 15:38:54,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888783266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:54,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:38:54,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:38:54,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929396516] [2021-12-14 15:38:54,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:54,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:38:54,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:54,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:38:54,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:38:54,872 INFO L87 Difference]: Start difference. First operand 2376 states and 4334 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:55,884 INFO L93 Difference]: Finished difference Result 2834 states and 5016 transitions. [2021-12-14 15:38:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 15:38:55,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-14 15:38:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:55,893 INFO L225 Difference]: With dead ends: 2834 [2021-12-14 15:38:55,893 INFO L226 Difference]: Without dead ends: 2589 [2021-12-14 15:38:55,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-14 15:38:55,896 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 4387 mSDsluCounter, 16343 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 20533 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 15:38:55,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4396 Valid, 20533 Invalid, 823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 15:38:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2021-12-14 15:38:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2490. [2021-12-14 15:38:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2428 states have (on average 1.8187808896210873) internal successors, (4416), 2433 states have internal predecessors, (4416), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-14 15:38:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4499 transitions. [2021-12-14 15:38:55,953 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4499 transitions. Word has length 69 [2021-12-14 15:38:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:38:55,954 INFO L470 AbstractCegarLoop]: Abstraction has 2490 states and 4499 transitions. [2021-12-14 15:38:55,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4499 transitions. [2021-12-14 15:38:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:38:55,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:55,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:38:55,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 15:38:55,956 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 302526504, now seen corresponding path program 1 times [2021-12-14 15:38:55,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:55,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833934878] [2021-12-14 15:38:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:55,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:55,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:56,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:56,033 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:38:56,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:56,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833934878] [2021-12-14 15:38:56,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833934878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:56,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:38:56,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:38:56,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257449285] [2021-12-14 15:38:56,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:56,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:38:56,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:56,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:38:56,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:38:56,036 INFO L87 Difference]: Start difference. First operand 2490 states and 4499 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:56,816 INFO L93 Difference]: Finished difference Result 3280 states and 5671 transitions. [2021-12-14 15:38:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:38:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-14 15:38:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:56,826 INFO L225 Difference]: With dead ends: 3280 [2021-12-14 15:38:56,826 INFO L226 Difference]: Without dead ends: 2921 [2021-12-14 15:38:56,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-14 15:38:56,829 INFO L933 BasicCegarLoop]: 4277 mSDtfsCounter, 4371 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4379 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 15:38:56,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4379 Valid, 20809 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 15:38:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2021-12-14 15:38:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2697. [2021-12-14 15:38:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2601 states have (on average 1.794309880815071) internal successors, (4667), 2608 states have internal predecessors, (4667), 60 states have call successors, (60), 31 states have call predecessors, (60), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2021-12-14 15:38:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4798 transitions. [2021-12-14 15:38:56,893 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4798 transitions. Word has length 69 [2021-12-14 15:38:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:38:56,893 INFO L470 AbstractCegarLoop]: Abstraction has 2697 states and 4798 transitions. [2021-12-14 15:38:56,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4798 transitions. [2021-12-14 15:38:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:38:56,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:56,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:38:56,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 15:38:56,895 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1840866534, now seen corresponding path program 1 times [2021-12-14 15:38:56,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:56,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807261178] [2021-12-14 15:38:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:56,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:56,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,012 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:38:57,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:57,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807261178] [2021-12-14 15:38:57,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807261178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:57,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:38:57,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:38:57,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529389299] [2021-12-14 15:38:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:57,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:38:57,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:38:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:38:57,014 INFO L87 Difference]: Start difference. First operand 2697 states and 4798 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:57,632 INFO L93 Difference]: Finished difference Result 3979 states and 6676 transitions. [2021-12-14 15:38:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:38:57,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-14 15:38:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:57,644 INFO L225 Difference]: With dead ends: 3979 [2021-12-14 15:38:57,644 INFO L226 Difference]: Without dead ends: 3413 [2021-12-14 15:38:57,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-14 15:38:57,647 INFO L933 BasicCegarLoop]: 4246 mSDtfsCounter, 4373 mSDsluCounter, 16535 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4385 SdHoareTripleChecker+Valid, 20781 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:38:57,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4385 Valid, 20781 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:38:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2021-12-14 15:38:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3126. [2021-12-14 15:38:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2964 states have (on average 1.75472334682861) internal successors, (5201), 2975 states have internal predecessors, (5201), 98 states have call successors, (98), 55 states have call predecessors, (98), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2021-12-14 15:38:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 5430 transitions. [2021-12-14 15:38:57,713 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 5430 transitions. Word has length 69 [2021-12-14 15:38:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:38:57,713 INFO L470 AbstractCegarLoop]: Abstraction has 3126 states and 5430 transitions. [2021-12-14 15:38:57,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:38:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 5430 transitions. [2021-12-14 15:38:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:38:57,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:57,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:38:57,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 15:38:57,715 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -187719576, now seen corresponding path program 1 times [2021-12-14 15:38:57,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:57,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77960145] [2021-12-14 15:38:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:57,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:57,766 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:38:57,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:57,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77960145] [2021-12-14 15:38:57,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77960145] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:57,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:38:57,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:38:57,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267346266] [2021-12-14 15:38:57,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:57,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:38:57,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:57,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:38:57,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:38:57,768 INFO L87 Difference]: Start difference. First operand 3126 states and 5430 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:38:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:58,277 INFO L93 Difference]: Finished difference Result 4980 states and 8171 transitions. [2021-12-14 15:38:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:38:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2021-12-14 15:38:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:58,289 INFO L225 Difference]: With dead ends: 4980 [2021-12-14 15:38:58,289 INFO L226 Difference]: Without dead ends: 3986 [2021-12-14 15:38:58,292 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:38:58,293 INFO L933 BasicCegarLoop]: 4304 mSDtfsCounter, 4501 mSDsluCounter, 12283 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4527 SdHoareTripleChecker+Valid, 16587 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:38:58,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4527 Valid, 16587 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:38:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2021-12-14 15:38:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3655. [2021-12-14 15:38:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 3405 states have (on average 1.7101321585903084) internal successors, (5823), 3425 states have internal predecessors, (5823), 152 states have call successors, (152), 85 states have call predecessors, (152), 96 states have return successors, (195), 152 states have call predecessors, (195), 150 states have call successors, (195) [2021-12-14 15:38:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 6170 transitions. [2021-12-14 15:38:58,373 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 6170 transitions. Word has length 69 [2021-12-14 15:38:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:38:58,374 INFO L470 AbstractCegarLoop]: Abstraction has 3655 states and 6170 transitions. [2021-12-14 15:38:58,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:38:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 6170 transitions. [2021-12-14 15:38:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-14 15:38:58,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:58,377 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, 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:38:58,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 15:38:58,377 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash 770021099, now seen corresponding path program 1 times [2021-12-14 15:38:58,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:58,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315415276] [2021-12-14 15:38:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:58,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:38:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:38:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 15:38:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 15:38:58,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:58,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315415276] [2021-12-14 15:38:58,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315415276] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:38:58,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641523758] [2021-12-14 15:38:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:58,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:38:58,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:38:58,469 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:38:58,503 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:38:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:58,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:38:58,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:38:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 15:38:58,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:38:58,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641523758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:58,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:38:58,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 15:38:58,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704657810] [2021-12-14 15:38:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:58,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:38:58,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:58,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:38:58,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:38:58,722 INFO L87 Difference]: Start difference. First operand 3655 states and 6170 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 15:38:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:58,831 INFO L93 Difference]: Finished difference Result 6624 states and 10494 transitions. [2021-12-14 15:38:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:38:58,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2021-12-14 15:38:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:58,850 INFO L225 Difference]: With dead ends: 6624 [2021-12-14 15:38:58,850 INFO L226 Difference]: Without dead ends: 5101 [2021-12-14 15:38:58,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 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:38:58,857 INFO L933 BasicCegarLoop]: 4161 mSDtfsCounter, 4109 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 4331 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:38:58,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4109 Valid, 4331 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:38:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2021-12-14 15:38:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5069. [2021-12-14 15:38:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4595 states have (on average 1.6426550598476606) internal successors, (7548), 4632 states have internal predecessors, (7548), 282 states have call successors, (282), 167 states have call predecessors, (282), 190 states have return successors, (363), 277 states have call predecessors, (363), 280 states have call successors, (363) [2021-12-14 15:38:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8193 transitions. [2021-12-14 15:38:59,001 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8193 transitions. Word has length 111 [2021-12-14 15:38:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:38:59,002 INFO L470 AbstractCegarLoop]: Abstraction has 5069 states and 8193 transitions. [2021-12-14 15:38:59,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 15:38:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8193 transitions. [2021-12-14 15:38:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-14 15:38:59,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:38:59,007 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, 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:38:59,041 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:38:59,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:38:59,224 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:38:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:38:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash -122535733, now seen corresponding path program 1 times [2021-12-14 15:38:59,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:38:59,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585082041] [2021-12-14 15:38:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:59,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:38:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:38:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:38:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:38:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:38:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:38:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:38:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:38:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 15:38:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 15:38:59,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:38:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585082041] [2021-12-14 15:38:59,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585082041] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:38:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479952977] [2021-12-14 15:38:59,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:38:59,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:38:59,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:38:59,336 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:38:59,393 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:38:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:38:59,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:38:59,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:38:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 15:38:59,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:38:59,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479952977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:38:59,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:38:59,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:38:59,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143029059] [2021-12-14 15:38:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:38:59,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:38:59,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:38:59,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:38:59,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:38:59,595 INFO L87 Difference]: Start difference. First operand 5069 states and 8193 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:38:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:38:59,815 INFO L93 Difference]: Finished difference Result 10733 states and 16467 transitions. [2021-12-14 15:38:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:38:59,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 111 [2021-12-14 15:38:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:38:59,847 INFO L225 Difference]: With dead ends: 10733 [2021-12-14 15:38:59,847 INFO L226 Difference]: Without dead ends: 7797 [2021-12-14 15:38:59,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 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:38:59,853 INFO L933 BasicCegarLoop]: 4309 mSDtfsCounter, 153 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 8458 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:38:59,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 8458 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:38:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7797 states. [2021-12-14 15:39:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7797 to 7797. [2021-12-14 15:39:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7797 states, 6882 states have (on average 1.568584713746004) internal successors, (10795), 6944 states have internal predecessors, (10795), 537 states have call successors, (537), 329 states have call predecessors, (537), 376 states have return successors, (786), 539 states have call predecessors, (786), 535 states have call successors, (786) [2021-12-14 15:39:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7797 states to 7797 states and 12118 transitions. [2021-12-14 15:39:00,056 INFO L78 Accepts]: Start accepts. Automaton has 7797 states and 12118 transitions. Word has length 111 [2021-12-14 15:39:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:00,056 INFO L470 AbstractCegarLoop]: Abstraction has 7797 states and 12118 transitions. [2021-12-14 15:39:00,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:39:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7797 states and 12118 transitions. [2021-12-14 15:39:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-14 15:39:00,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:00,068 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, 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:39:00,085 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:39:00,285 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,SelfDestructingSolverStorable7 [2021-12-14 15:39:00,285 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash 327119452, now seen corresponding path program 1 times [2021-12-14 15:39:00,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87781527] [2021-12-14 15:39:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:00,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:39:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:39:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 15:39:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-14 15:39:00,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:00,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87781527] [2021-12-14 15:39:00,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87781527] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:00,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920872430] [2021-12-14 15:39:00,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:00,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:00,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:00,366 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:39:00,399 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:39:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:00,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:39:00,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 15:39:00,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:00,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920872430] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:00,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:00,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 15:39:00,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081830517] [2021-12-14 15:39:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:00,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:00,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:00,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:00,615 INFO L87 Difference]: Start difference. First operand 7797 states and 12118 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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:39:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:00,889 INFO L93 Difference]: Finished difference Result 18877 states and 28229 transitions. [2021-12-14 15:39:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:00,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2021-12-14 15:39:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:00,928 INFO L225 Difference]: With dead ends: 18877 [2021-12-14 15:39:00,929 INFO L226 Difference]: Without dead ends: 13217 [2021-12-14 15:39:00,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 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:39:00,948 INFO L933 BasicCegarLoop]: 4182 mSDtfsCounter, 4067 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4067 SdHoareTripleChecker+Valid, 4352 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:39:00,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4067 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13217 states. [2021-12-14 15:39:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13217 to 13101. [2021-12-14 15:39:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13101 states, 11334 states have (on average 1.5130580554085054) internal successors, (17149), 11454 states have internal predecessors, (17149), 1023 states have call successors, (1023), 647 states have call predecessors, (1023), 742 states have return successors, (1484), 1015 states have call predecessors, (1484), 1021 states have call successors, (1484) [2021-12-14 15:39:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13101 states to 13101 states and 19656 transitions. [2021-12-14 15:39:01,421 INFO L78 Accepts]: Start accepts. Automaton has 13101 states and 19656 transitions. Word has length 143 [2021-12-14 15:39:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:01,421 INFO L470 AbstractCegarLoop]: Abstraction has 13101 states and 19656 transitions. [2021-12-14 15:39:01,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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:39:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13101 states and 19656 transitions. [2021-12-14 15:39:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-14 15:39:01,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:01,442 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, 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, 1, 1] [2021-12-14 15:39:01,473 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:39:01,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:01,658 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 382011958, now seen corresponding path program 1 times [2021-12-14 15:39:01,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:01,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274830588] [2021-12-14 15:39:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:01,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 15:39:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 15:39:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-14 15:39:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 15:39:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 15:39:01,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:01,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274830588] [2021-12-14 15:39:01,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274830588] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:01,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902485067] [2021-12-14 15:39:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:01,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:01,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:01,737 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:39:01,738 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:39:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:01,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:39:01,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 15:39:02,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:02,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902485067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:02,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:02,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:02,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501613863] [2021-12-14 15:39:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:02,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:02,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:02,016 INFO L87 Difference]: Start difference. First operand 13101 states and 19656 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:39:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:02,330 INFO L93 Difference]: Finished difference Result 25341 states and 37502 transitions. [2021-12-14 15:39:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2021-12-14 15:39:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:02,371 INFO L225 Difference]: With dead ends: 25341 [2021-12-14 15:39:02,371 INFO L226 Difference]: Without dead ends: 14375 [2021-12-14 15:39:02,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 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:39:02,401 INFO L933 BasicCegarLoop]: 4148 mSDtfsCounter, 4086 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:02,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4086 Valid, 4182 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14375 states. [2021-12-14 15:39:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14375 to 14375. [2021-12-14 15:39:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14375 states, 12492 states have (on average 1.4571725904578932) internal successors, (18203), 12612 states have internal predecessors, (18203), 1053 states have call successors, (1053), 733 states have call predecessors, (1053), 828 states have return successors, (1522), 1045 states have call predecessors, (1522), 1051 states have call successors, (1522) [2021-12-14 15:39:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14375 states to 14375 states and 20778 transitions. [2021-12-14 15:39:02,996 INFO L78 Accepts]: Start accepts. Automaton has 14375 states and 20778 transitions. Word has length 160 [2021-12-14 15:39:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:02,997 INFO L470 AbstractCegarLoop]: Abstraction has 14375 states and 20778 transitions. [2021-12-14 15:39:02,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:39:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 14375 states and 20778 transitions. [2021-12-14 15:39:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-14 15:39:03,022 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:03,022 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, 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, 1, 1, 1] [2021-12-14 15:39:03,041 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:39:03,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:03,242 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash 228383827, now seen corresponding path program 1 times [2021-12-14 15:39:03,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:03,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614496850] [2021-12-14 15:39:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:03,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 15:39:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 15:39:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-14 15:39:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 15:39:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-14 15:39:03,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614496850] [2021-12-14 15:39:03,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614496850] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236575123] [2021-12-14 15:39:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:03,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:03,335 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:39:03,359 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:39:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:03,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:39:03,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-14 15:39:03,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:03,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236575123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:03,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:03,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:03,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698315076] [2021-12-14 15:39:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:03,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:03,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:03,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:03,645 INFO L87 Difference]: Start difference. First operand 14375 states and 20778 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:39:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:04,161 INFO L93 Difference]: Finished difference Result 23728 states and 33596 transitions. [2021-12-14 15:39:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:04,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 160 [2021-12-14 15:39:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:04,197 INFO L225 Difference]: With dead ends: 23728 [2021-12-14 15:39:04,197 INFO L226 Difference]: Without dead ends: 15235 [2021-12-14 15:39:04,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 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:39:04,213 INFO L933 BasicCegarLoop]: 4170 mSDtfsCounter, 4087 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 4347 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:39:04,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4087 Valid, 4347 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15235 states. [2021-12-14 15:39:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15235 to 15159. [2021-12-14 15:39:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15159 states, 13212 states have (on average 1.4319557977596125) internal successors, (18919), 13332 states have internal predecessors, (18919), 1065 states have call successors, (1065), 785 states have call predecessors, (1065), 880 states have return successors, (1586), 1057 states have call predecessors, (1586), 1063 states have call successors, (1586) [2021-12-14 15:39:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15159 states to 15159 states and 21570 transitions. [2021-12-14 15:39:04,651 INFO L78 Accepts]: Start accepts. Automaton has 15159 states and 21570 transitions. Word has length 160 [2021-12-14 15:39:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:04,651 INFO L470 AbstractCegarLoop]: Abstraction has 15159 states and 21570 transitions. [2021-12-14 15:39:04,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:39:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15159 states and 21570 transitions. [2021-12-14 15:39:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:39:04,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:04,672 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, 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, 1, 1, 1, 1, 1] [2021-12-14 15:39:04,694 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:39:04,892 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,SelfDestructingSolverStorable10 [2021-12-14 15:39:04,893 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1570525413, now seen corresponding path program 1 times [2021-12-14 15:39:04,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:04,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105199483] [2021-12-14 15:39:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:04,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:39:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:39:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:39:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:05,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:39:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-14 15:39:05,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:05,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105199483] [2021-12-14 15:39:05,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105199483] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:05,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035607702] [2021-12-14 15:39:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:05,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:05,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:05,006 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:39:05,008 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:39:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:05,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:39:05,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 15:39:05,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:05,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035607702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:05,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:05,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:05,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333491585] [2021-12-14 15:39:05,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:05,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:05,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:05,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:05,296 INFO L87 Difference]: Start difference. First operand 15159 states and 21570 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:39:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:06,236 INFO L93 Difference]: Finished difference Result 40537 states and 56372 transitions. [2021-12-14 15:39:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:06,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-14 15:39:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:06,403 INFO L225 Difference]: With dead ends: 40537 [2021-12-14 15:39:06,403 INFO L226 Difference]: Without dead ends: 27517 [2021-12-14 15:39:06,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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:39:06,431 INFO L933 BasicCegarLoop]: 4318 mSDtfsCounter, 162 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 8464 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:39:06,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 8464 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27517 states. [2021-12-14 15:39:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27517 to 27489. [2021-12-14 15:39:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27489 states, 23696 states have (on average 1.3850860904794058) internal successors, (32821), 23934 states have internal predecessors, (32821), 2063 states have call successors, (2063), 1537 states have call predecessors, (2063), 1728 states have return successors, (3558), 2049 states have call predecessors, (3558), 2061 states have call successors, (3558) [2021-12-14 15:39:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27489 states to 27489 states and 38442 transitions. [2021-12-14 15:39:07,334 INFO L78 Accepts]: Start accepts. Automaton has 27489 states and 38442 transitions. Word has length 161 [2021-12-14 15:39:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:07,335 INFO L470 AbstractCegarLoop]: Abstraction has 27489 states and 38442 transitions. [2021-12-14 15:39:07,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:39:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27489 states and 38442 transitions. [2021-12-14 15:39:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:39:07,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:07,377 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, 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, 1, 1, 1, 1, 1, 1] [2021-12-14 15:39:07,394 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:39:07,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:07,595 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:07,595 INFO L85 PathProgramCache]: Analyzing trace with hash -948353227, now seen corresponding path program 1 times [2021-12-14 15:39:07,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:07,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381412409] [2021-12-14 15:39:07,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:07,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:39:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:39:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:39:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 15:39:07,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:07,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381412409] [2021-12-14 15:39:07,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381412409] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:07,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700176039] [2021-12-14 15:39:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:07,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:07,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:07,712 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:39:07,751 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:39:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:07,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:39:07,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-14 15:39:08,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:08,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700176039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:08,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:08,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:08,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428203809] [2021-12-14 15:39:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:08,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:08,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:08,062 INFO L87 Difference]: Start difference. First operand 27489 states and 38442 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:39:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:08,716 INFO L93 Difference]: Finished difference Result 45781 states and 64487 transitions. [2021-12-14 15:39:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:08,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 161 [2021-12-14 15:39:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:08,785 INFO L225 Difference]: With dead ends: 45781 [2021-12-14 15:39:08,786 INFO L226 Difference]: Without dead ends: 24869 [2021-12-14 15:39:08,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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:39:08,823 INFO L933 BasicCegarLoop]: 4147 mSDtfsCounter, 4081 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:08,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4081 Valid, 4180 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24869 states. [2021-12-14 15:39:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24869 to 19189. [2021-12-14 15:39:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19189 states, 16676 states have (on average 1.3680139122091628) internal successors, (22813), 16806 states have internal predecessors, (22813), 1375 states have call successors, (1375), 1041 states have call predecessors, (1375), 1136 states have return successors, (2154), 1357 states have call predecessors, (2154), 1373 states have call successors, (2154) [2021-12-14 15:39:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19189 states to 19189 states and 26342 transitions. [2021-12-14 15:39:09,624 INFO L78 Accepts]: Start accepts. Automaton has 19189 states and 26342 transitions. Word has length 161 [2021-12-14 15:39:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:09,624 INFO L470 AbstractCegarLoop]: Abstraction has 19189 states and 26342 transitions. [2021-12-14 15:39:09,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:39:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19189 states and 26342 transitions. [2021-12-14 15:39:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:39:09,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:09,642 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, 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, 1, 1, 1] [2021-12-14 15:39:09,671 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:39:09,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:09,874 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash -192882952, now seen corresponding path program 1 times [2021-12-14 15:39:09,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:09,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131863874] [2021-12-14 15:39:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:09,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:39:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:39:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:39:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 15:39:09,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131863874] [2021-12-14 15:39:09,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131863874] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703040755] [2021-12-14 15:39:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:09,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:09,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:09,962 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:39:09,964 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:39:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:10,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:39:10,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 15:39:10,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:10,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703040755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:10,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:10,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:10,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970735818] [2021-12-14 15:39:10,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:10,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:10,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:10,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:10,241 INFO L87 Difference]: Start difference. First operand 19189 states and 26342 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:39:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:11,345 INFO L93 Difference]: Finished difference Result 50633 states and 68394 transitions. [2021-12-14 15:39:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 161 [2021-12-14 15:39:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:11,426 INFO L225 Difference]: With dead ends: 50633 [2021-12-14 15:39:11,427 INFO L226 Difference]: Without dead ends: 33593 [2021-12-14 15:39:11,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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:39:11,455 INFO L933 BasicCegarLoop]: 4312 mSDtfsCounter, 149 mSDsluCounter, 4143 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 8455 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:39:11,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 8455 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33593 states. [2021-12-14 15:39:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33593 to 33589. [2021-12-14 15:39:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33589 states, 28856 states have (on average 1.327314943166066) internal successors, (38301), 29114 states have internal predecessors, (38301), 2603 states have call successors, (2603), 1937 states have call predecessors, (2603), 2128 states have return successors, (4736), 2569 states have call predecessors, (4736), 2601 states have call successors, (4736) [2021-12-14 15:39:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33589 states to 33589 states and 45640 transitions. [2021-12-14 15:39:12,666 INFO L78 Accepts]: Start accepts. Automaton has 33589 states and 45640 transitions. Word has length 161 [2021-12-14 15:39:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:12,666 INFO L470 AbstractCegarLoop]: Abstraction has 33589 states and 45640 transitions. [2021-12-14 15:39:12,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:39:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 33589 states and 45640 transitions. [2021-12-14 15:39:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:39:12,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:12,695 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, 3, 3, 3, 3, 3, 3, 3, 3, 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:39:12,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 15:39:12,931 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,SelfDestructingSolverStorable13 [2021-12-14 15:39:12,931 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1491732838, now seen corresponding path program 1 times [2021-12-14 15:39:12,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:12,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032077926] [2021-12-14 15:39:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:12,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:39:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:39:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:39:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:39:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-14 15:39:13,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:13,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032077926] [2021-12-14 15:39:13,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032077926] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:13,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534733415] [2021-12-14 15:39:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:13,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:13,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:13,039 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:39:13,041 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:39:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:13,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:39:13,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 15:39:13,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:13,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534733415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:13,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:13,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:13,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138648134] [2021-12-14 15:39:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:13,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:13,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:13,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:13,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:13,339 INFO L87 Difference]: Start difference. First operand 33589 states and 45640 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:39:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:14,331 INFO L93 Difference]: Finished difference Result 58387 states and 78608 transitions. [2021-12-14 15:39:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 161 [2021-12-14 15:39:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:14,441 INFO L225 Difference]: With dead ends: 58387 [2021-12-14 15:39:14,441 INFO L226 Difference]: Without dead ends: 34097 [2021-12-14 15:39:14,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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:39:14,502 INFO L933 BasicCegarLoop]: 4185 mSDtfsCounter, 4107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 4355 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:14,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4107 Valid, 4355 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34097 states. [2021-12-14 15:39:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34097 to 33589. [2021-12-14 15:39:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33589 states, 28856 states have (on average 1.3198294981979484) internal successors, (38085), 29114 states have internal predecessors, (38085), 2603 states have call successors, (2603), 1937 states have call predecessors, (2603), 2128 states have return successors, (4736), 2569 states have call predecessors, (4736), 2601 states have call successors, (4736) [2021-12-14 15:39:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33589 states to 33589 states and 45424 transitions. [2021-12-14 15:39:15,756 INFO L78 Accepts]: Start accepts. Automaton has 33589 states and 45424 transitions. Word has length 161 [2021-12-14 15:39:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:15,757 INFO L470 AbstractCegarLoop]: Abstraction has 33589 states and 45424 transitions. [2021-12-14 15:39:15,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:39:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 33589 states and 45424 transitions. [2021-12-14 15:39:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:39:15,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:15,783 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, 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, 1, 1, 1, 1, 1] [2021-12-14 15:39:15,812 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:39:15,997 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,SelfDestructingSolverStorable14 [2021-12-14 15:39:15,997 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:15,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash -251057197, now seen corresponding path program 1 times [2021-12-14 15:39:15,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:15,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810949495] [2021-12-14 15:39:15,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:15,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:39:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:39:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:39:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-14 15:39:16,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:16,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810949495] [2021-12-14 15:39:16,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810949495] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:16,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527602475] [2021-12-14 15:39:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:16,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:16,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:16,081 INFO L229 MonitoredProcess]: Starting monitored process 11 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:39:16,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 15:39:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:16,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:39:16,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-14 15:39:16,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:16,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527602475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:16,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:16,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:16,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072534279] [2021-12-14 15:39:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:16,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:16,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:16,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:16,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:16,404 INFO L87 Difference]: Start difference. First operand 33589 states and 45424 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:39:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:17,300 INFO L93 Difference]: Finished difference Result 57833 states and 77578 transitions. [2021-12-14 15:39:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:17,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 161 [2021-12-14 15:39:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:17,399 INFO L225 Difference]: With dead ends: 57833 [2021-12-14 15:39:17,399 INFO L226 Difference]: Without dead ends: 34385 [2021-12-14 15:39:17,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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:39:17,446 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4106 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4371 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:17,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4106 Valid, 4371 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34385 states. [2021-12-14 15:39:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34385 to 33517. [2021-12-14 15:39:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33517 states, 28784 states have (on average 1.3131253474152307) internal successors, (37797), 29042 states have internal predecessors, (37797), 2603 states have call successors, (2603), 1937 states have call predecessors, (2603), 2128 states have return successors, (4736), 2569 states have call predecessors, (4736), 2601 states have call successors, (4736) [2021-12-14 15:39:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33517 states to 33517 states and 45136 transitions. [2021-12-14 15:39:18,866 INFO L78 Accepts]: Start accepts. Automaton has 33517 states and 45136 transitions. Word has length 161 [2021-12-14 15:39:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:18,866 INFO L470 AbstractCegarLoop]: Abstraction has 33517 states and 45136 transitions. [2021-12-14 15:39:18,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:39:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33517 states and 45136 transitions. [2021-12-14 15:39:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:39:18,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:18,898 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, 3, 3, 3, 3, 3, 3, 3, 3, 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:39:18,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:19,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 15:39:19,111 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:19,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2084105626, now seen corresponding path program 1 times [2021-12-14 15:39:19,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:19,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813463218] [2021-12-14 15:39:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:19,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:39:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:39:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:39:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:39:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-14 15:39:19,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:19,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813463218] [2021-12-14 15:39:19,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813463218] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:19,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:39:19,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:39:19,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986118998] [2021-12-14 15:39:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:19,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:39:19,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:19,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:39:19,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:39:19,200 INFO L87 Difference]: Start difference. First operand 33517 states and 45136 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:39:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:20,391 INFO L93 Difference]: Finished difference Result 63727 states and 84123 transitions. [2021-12-14 15:39:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:39:20,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-14 15:39:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:20,481 INFO L225 Difference]: With dead ends: 63727 [2021-12-14 15:39:20,482 INFO L226 Difference]: Without dead ends: 32355 [2021-12-14 15:39:20,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:20,531 INFO L933 BasicCegarLoop]: 4146 mSDtfsCounter, 294 mSDsluCounter, 12026 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 16172 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:20,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 16172 Invalid, 209 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:39:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32355 states. [2021-12-14 15:39:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32355 to 30363. [2021-12-14 15:39:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30363 states, 26282 states have (on average 1.3175937904269082) internal successors, (34629), 26796 states have internal predecessors, (34629), 1983 states have call successors, (1983), 1489 states have call predecessors, (1983), 2096 states have return successors, (3933), 2093 states have call predecessors, (3933), 1981 states have call successors, (3933) [2021-12-14 15:39:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 40545 transitions. [2021-12-14 15:39:21,860 INFO L78 Accepts]: Start accepts. Automaton has 30363 states and 40545 transitions. Word has length 161 [2021-12-14 15:39:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:21,860 INFO L470 AbstractCegarLoop]: Abstraction has 30363 states and 40545 transitions. [2021-12-14 15:39:21,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:39:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 30363 states and 40545 transitions. [2021-12-14 15:39:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:39:21,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:21,880 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, 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, 1, 1, 1] [2021-12-14 15:39:21,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 15:39:21,880 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash 641108433, now seen corresponding path program 1 times [2021-12-14 15:39:21,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:21,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067599074] [2021-12-14 15:39:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:21,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:39:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:39:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:39:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-14 15:39:21,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067599074] [2021-12-14 15:39:21,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067599074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:21,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:39:21,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:39:21,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150793705] [2021-12-14 15:39:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:21,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:39:21,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:39:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:39:21,941 INFO L87 Difference]: Start difference. First operand 30363 states and 40545 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:39:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:23,132 INFO L93 Difference]: Finished difference Result 53149 states and 69944 transitions. [2021-12-14 15:39:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:39:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-14 15:39:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:23,180 INFO L225 Difference]: With dead ends: 53149 [2021-12-14 15:39:23,180 INFO L226 Difference]: Without dead ends: 24923 [2021-12-14 15:39:23,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:23,210 INFO L933 BasicCegarLoop]: 4145 mSDtfsCounter, 294 mSDsluCounter, 12025 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 16170 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:23,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 16170 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:39:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24923 states. [2021-12-14 15:39:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24923 to 23065. [2021-12-14 15:39:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23065 states, 20082 states have (on average 1.3415496464495569) internal successors, (26941), 20442 states have internal predecessors, (26941), 1457 states have call successors, (1457), 1101 states have call predecessors, (1457), 1524 states have return successors, (2723), 1529 states have call predecessors, (2723), 1455 states have call successors, (2723) [2021-12-14 15:39:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 31121 transitions. [2021-12-14 15:39:24,040 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 31121 transitions. Word has length 161 [2021-12-14 15:39:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:24,040 INFO L470 AbstractCegarLoop]: Abstraction has 23065 states and 31121 transitions. [2021-12-14 15:39:24,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:39:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 31121 transitions. [2021-12-14 15:39:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 15:39:24,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:24,052 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, 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, 1, 1, 1] [2021-12-14 15:39:24,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 15:39:24,053 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash -22034244, now seen corresponding path program 1 times [2021-12-14 15:39:24,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:24,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949701664] [2021-12-14 15:39:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:24,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 15:39:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:39:24,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:24,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949701664] [2021-12-14 15:39:24,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949701664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:24,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817503226] [2021-12-14 15:39:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:24,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:24,118 INFO L229 MonitoredProcess]: Starting monitored process 12 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:39:24,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 15:39:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:24,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:39:24,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 15:39:24,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:24,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817503226] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:24,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:24,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:24,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89579713] [2021-12-14 15:39:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:24,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:24,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:24,434 INFO L87 Difference]: Start difference. First operand 23065 states and 31121 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:39:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:25,020 INFO L93 Difference]: Finished difference Result 36999 states and 50557 transitions. [2021-12-14 15:39:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:25,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 163 [2021-12-14 15:39:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:25,186 INFO L225 Difference]: With dead ends: 36999 [2021-12-14 15:39:25,187 INFO L226 Difference]: Without dead ends: 23165 [2021-12-14 15:39:25,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 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:39:25,205 INFO L933 BasicCegarLoop]: 4250 mSDtfsCounter, 141 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 8376 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:39:25,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 8376 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23165 states. [2021-12-14 15:39:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23165 to 23065. [2021-12-14 15:39:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23065 states, 20082 states have (on average 1.3218304949706206) internal successors, (26545), 20442 states have internal predecessors, (26545), 1457 states have call successors, (1457), 1101 states have call predecessors, (1457), 1524 states have return successors, (2723), 1529 states have call predecessors, (2723), 1455 states have call successors, (2723) [2021-12-14 15:39:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 30725 transitions. [2021-12-14 15:39:25,909 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 30725 transitions. Word has length 163 [2021-12-14 15:39:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:25,910 INFO L470 AbstractCegarLoop]: Abstraction has 23065 states and 30725 transitions. [2021-12-14 15:39:25,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:39:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 30725 transitions. [2021-12-14 15:39:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 15:39:25,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:25,926 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, 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, 1, 1] [2021-12-14 15:39:25,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-14 15:39:26,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:26,140 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1309860060, now seen corresponding path program 1 times [2021-12-14 15:39:26,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:26,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396537603] [2021-12-14 15:39:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:26,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 15:39:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:39:26,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396537603] [2021-12-14 15:39:26,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396537603] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834592700] [2021-12-14 15:39:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:26,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:26,267 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39:26,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 15:39:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:26,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:39:26,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 15:39:26,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:26,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834592700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:26,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:26,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:26,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67102097] [2021-12-14 15:39:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:26,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:26,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:26,694 INFO L87 Difference]: Start difference. First operand 23065 states and 30725 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:39:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:27,471 INFO L93 Difference]: Finished difference Result 40981 states and 54667 transitions. [2021-12-14 15:39:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:27,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 163 [2021-12-14 15:39:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:27,524 INFO L225 Difference]: With dead ends: 40981 [2021-12-14 15:39:27,524 INFO L226 Difference]: Without dead ends: 21259 [2021-12-14 15:39:27,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 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:39:27,564 INFO L933 BasicCegarLoop]: 4146 mSDtfsCounter, 4121 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 4178 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:39:27,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4121 Valid, 4178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2021-12-14 15:39:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 20493. [2021-12-14 15:39:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 17926 states have (on average 1.2979471159210085) internal successors, (23267), 18223 states have internal predecessors, (23267), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:39:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 26741 transitions. [2021-12-14 15:39:28,382 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 26741 transitions. Word has length 163 [2021-12-14 15:39:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:28,382 INFO L470 AbstractCegarLoop]: Abstraction has 20493 states and 26741 transitions. [2021-12-14 15:39:28,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:39:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 26741 transitions. [2021-12-14 15:39:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 15:39:28,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:28,393 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, 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, 1, 1] [2021-12-14 15:39:28,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:28,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:28,607 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1003109181, now seen corresponding path program 1 times [2021-12-14 15:39:28,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:28,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036263320] [2021-12-14 15:39:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:28,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-14 15:39:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 15:39:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 15:39:28,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:28,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036263320] [2021-12-14 15:39:28,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036263320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:28,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796534701] [2021-12-14 15:39:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:28,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:28,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:28,744 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39:28,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 15:39:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:28,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:39:28,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 15:39:29,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:29,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796534701] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:29,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:29,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:29,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544400606] [2021-12-14 15:39:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:29,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:29,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:29,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:29,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:29,067 INFO L87 Difference]: Start difference. First operand 20493 states and 26741 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:39:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:29,698 INFO L93 Difference]: Finished difference Result 33605 states and 44123 transitions. [2021-12-14 15:39:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 163 [2021-12-14 15:39:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:29,742 INFO L225 Difference]: With dead ends: 33605 [2021-12-14 15:39:29,742 INFO L226 Difference]: Without dead ends: 20585 [2021-12-14 15:39:29,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 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:39:29,764 INFO L933 BasicCegarLoop]: 4293 mSDtfsCounter, 134 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 8418 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:39:29,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 8418 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20585 states. [2021-12-14 15:39:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 20493. [2021-12-14 15:39:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 17926 states have (on average 1.2739596117371417) internal successors, (22837), 18223 states have internal predecessors, (22837), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:39:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 26311 transitions. [2021-12-14 15:39:30,439 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 26311 transitions. Word has length 163 [2021-12-14 15:39:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:30,439 INFO L470 AbstractCegarLoop]: Abstraction has 20493 states and 26311 transitions. [2021-12-14 15:39:30,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:39:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 26311 transitions. [2021-12-14 15:39:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-14 15:39:30,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:30,449 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, 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, 1, 1, 1] [2021-12-14 15:39:30,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:30,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-14 15:39:30,663 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1504083699, now seen corresponding path program 1 times [2021-12-14 15:39:30,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:30,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127592903] [2021-12-14 15:39:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:30,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-14 15:39:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:39:30,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:30,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127592903] [2021-12-14 15:39:30,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127592903] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:30,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688373377] [2021-12-14 15:39:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:30,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:30,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:30,767 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:30,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 15:39:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:30,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:39:30,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 15:39:31,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:31,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688373377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:31,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:31,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:39:31,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815793860] [2021-12-14 15:39:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:31,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:39:31,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:31,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:39:31,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:39:31,109 INFO L87 Difference]: Start difference. First operand 20493 states and 26311 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:39:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:31,630 INFO L93 Difference]: Finished difference Result 29178 states and 37623 transitions. [2021-12-14 15:39:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:39:31,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 164 [2021-12-14 15:39:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:31,680 INFO L225 Difference]: With dead ends: 29178 [2021-12-14 15:39:31,680 INFO L226 Difference]: Without dead ends: 20523 [2021-12-14 15:39:31,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 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:39:31,705 INFO L933 BasicCegarLoop]: 4273 mSDtfsCounter, 155 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 8390 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:31,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 8390 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20523 states. [2021-12-14 15:39:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20523 to 20493. [2021-12-14 15:39:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 17926 states have (on average 1.2651455985719067) internal successors, (22679), 18223 states have internal predecessors, (22679), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:39:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 26153 transitions. [2021-12-14 15:39:32,448 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 26153 transitions. Word has length 164 [2021-12-14 15:39:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:32,448 INFO L470 AbstractCegarLoop]: Abstraction has 20493 states and 26153 transitions. [2021-12-14 15:39:32,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:39:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 26153 transitions. [2021-12-14 15:39:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:39:32,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:32,457 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, 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, 1, 1, 1, 1] [2021-12-14 15:39:32,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:32,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:32,671 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -465623340, now seen corresponding path program 1 times [2021-12-14 15:39:32,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:32,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400006020] [2021-12-14 15:39:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:32,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:39:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:39:32,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400006020] [2021-12-14 15:39:32,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400006020] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296628436] [2021-12-14 15:39:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:32,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:32,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:32,803 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:32,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 15:39:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:32,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 15:39:32,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 15:39:33,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:33,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296628436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:33,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:33,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 15:39:33,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909731519] [2021-12-14 15:39:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:33,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:39:33,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:39:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 15:39:33,151 INFO L87 Difference]: Start difference. First operand 20493 states and 26153 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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:39:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:33,927 INFO L93 Difference]: Finished difference Result 38811 states and 48454 transitions. [2021-12-14 15:39:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 15:39:33,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2021-12-14 15:39:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:33,967 INFO L225 Difference]: With dead ends: 38811 [2021-12-14 15:39:33,967 INFO L226 Difference]: Without dead ends: 20457 [2021-12-14 15:39:33,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:39:33,985 INFO L933 BasicCegarLoop]: 4121 mSDtfsCounter, 4145 mSDsluCounter, 8103 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 12224 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:33,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4154 Valid, 12224 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:39:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20457 states. [2021-12-14 15:39:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20457 to 20457. [2021-12-14 15:39:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20457 states, 17890 states have (on average 1.2502515371716043) internal successors, (22367), 18187 states have internal predecessors, (22367), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:39:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20457 states to 20457 states and 25841 transitions. [2021-12-14 15:39:34,650 INFO L78 Accepts]: Start accepts. Automaton has 20457 states and 25841 transitions. Word has length 165 [2021-12-14 15:39:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:34,651 INFO L470 AbstractCegarLoop]: Abstraction has 20457 states and 25841 transitions. [2021-12-14 15:39:34,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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:39:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 20457 states and 25841 transitions. [2021-12-14 15:39:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:39:34,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:34,661 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, 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, 1, 1, 1, 1] [2021-12-14 15:39:34,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:34,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:34,878 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:34,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 22423766, now seen corresponding path program 1 times [2021-12-14 15:39:34,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:34,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354413339] [2021-12-14 15:39:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:34,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:39:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:39:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:39:34,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:34,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354413339] [2021-12-14 15:39:34,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354413339] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:34,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560358352] [2021-12-14 15:39:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:34,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:34,948 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:34,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 15:39:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:35,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:39:35,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-12-14 15:39:35,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:35,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560358352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:35,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:35,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:39:35,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961003136] [2021-12-14 15:39:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:35,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:39:35,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:35,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:39:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:39:35,229 INFO L87 Difference]: Start difference. First operand 20457 states and 25841 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:39:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:35,911 INFO L93 Difference]: Finished difference Result 32886 states and 41058 transitions. [2021-12-14 15:39:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:39:35,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 165 [2021-12-14 15:39:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:35,944 INFO L225 Difference]: With dead ends: 32886 [2021-12-14 15:39:35,944 INFO L226 Difference]: Without dead ends: 14561 [2021-12-14 15:39:35,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:39:35,970 INFO L933 BasicCegarLoop]: 4137 mSDtfsCounter, 87 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 16572 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:39:35,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 16572 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14561 states. [2021-12-14 15:39:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 13864. [2021-12-14 15:39:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13864 states, 12145 states have (on average 1.2735282009057225) internal successors, (15467), 12331 states have internal predecessors, (15467), 850 states have call successors, (850), 649 states have call predecessors, (850), 867 states have return successors, (1346), 885 states have call predecessors, (1346), 848 states have call successors, (1346) [2021-12-14 15:39:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13864 states to 13864 states and 17663 transitions. [2021-12-14 15:39:36,476 INFO L78 Accepts]: Start accepts. Automaton has 13864 states and 17663 transitions. Word has length 165 [2021-12-14 15:39:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:36,476 INFO L470 AbstractCegarLoop]: Abstraction has 13864 states and 17663 transitions. [2021-12-14 15:39:36,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:39:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13864 states and 17663 transitions. [2021-12-14 15:39:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:39:36,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:36,483 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, 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, 1, 1, 1, 1] [2021-12-14 15:39:36,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:36,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 15:39:36,702 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1805871025, now seen corresponding path program 1 times [2021-12-14 15:39:36,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:36,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476430543] [2021-12-14 15:39:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:36,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 15:39:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:39:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-14 15:39:36,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:36,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476430543] [2021-12-14 15:39:36,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476430543] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:36,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576721723] [2021-12-14 15:39:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:36,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:36,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:36,787 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:36,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 15:39:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:36,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:39:36,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-14 15:39:37,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:37,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576721723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:37,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:37,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:39:37,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002623546] [2021-12-14 15:39:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:37,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:39:37,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:39:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:39:37,134 INFO L87 Difference]: Start difference. First operand 13864 states and 17663 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:39:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:37,615 INFO L93 Difference]: Finished difference Result 23605 states and 29361 transitions. [2021-12-14 15:39:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:39:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 165 [2021-12-14 15:39:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:37,641 INFO L225 Difference]: With dead ends: 23605 [2021-12-14 15:39:37,641 INFO L226 Difference]: Without dead ends: 11873 [2021-12-14 15:39:37,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:39:37,661 INFO L933 BasicCegarLoop]: 4136 mSDtfsCounter, 49 mSDsluCounter, 12422 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16558 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:39:37,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 16558 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2021-12-14 15:39:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 11651. [2021-12-14 15:39:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11651 states, 10225 states have (on average 1.2828361858190709) internal successors, (13117), 10367 states have internal predecessors, (13117), 713 states have call successors, (713), 539 states have call predecessors, (713), 711 states have return successors, (1043), 746 states have call predecessors, (1043), 711 states have call successors, (1043) [2021-12-14 15:39:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11651 states to 11651 states and 14873 transitions. [2021-12-14 15:39:38,127 INFO L78 Accepts]: Start accepts. Automaton has 11651 states and 14873 transitions. Word has length 165 [2021-12-14 15:39:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:38,127 INFO L470 AbstractCegarLoop]: Abstraction has 11651 states and 14873 transitions. [2021-12-14 15:39:38,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:39:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 11651 states and 14873 transitions. [2021-12-14 15:39:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:39:38,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:38,132 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, 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, 1, 1, 1, 1] [2021-12-14 15:39:38,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:38,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:38,336 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:38,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1637482603, now seen corresponding path program 1 times [2021-12-14 15:39:38,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:38,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352242260] [2021-12-14 15:39:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:38,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:39:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:39:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 15:39:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:39:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-14 15:39:38,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352242260] [2021-12-14 15:39:38,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352242260] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:39:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796694708] [2021-12-14 15:39:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:38,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:38,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:39:38,425 INFO L229 MonitoredProcess]: Starting monitored process 19 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:39:38,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-14 15:39:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:38,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:39:38,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:39:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 15:39:38,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:39:38,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796694708] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:38,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:39:38,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:39:38,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388170866] [2021-12-14 15:39:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:38,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:39:38,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:38,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:39:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:39:38,796 INFO L87 Difference]: Start difference. First operand 11651 states and 14873 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:39:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:39,017 INFO L93 Difference]: Finished difference Result 16233 states and 20187 transitions. [2021-12-14 15:39:39,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:39:39,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 165 [2021-12-14 15:39:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:39,025 INFO L225 Difference]: With dead ends: 16233 [2021-12-14 15:39:39,025 INFO L226 Difference]: Without dead ends: 4951 [2021-12-14 15:39:39,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:39:39,035 INFO L933 BasicCegarLoop]: 4136 mSDtfsCounter, 10 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16543 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:39:39,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16543 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:39:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2021-12-14 15:39:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4951. [2021-12-14 15:39:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4951 states, 4523 states have (on average 1.4623037806765422) internal successors, (6614), 4545 states have internal predecessors, (6614), 240 states have call successors, (240), 171 states have call predecessors, (240), 186 states have return successors, (263), 236 states have call predecessors, (263), 238 states have call successors, (263) [2021-12-14 15:39:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 7117 transitions. [2021-12-14 15:39:39,146 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 7117 transitions. Word has length 165 [2021-12-14 15:39:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:39,146 INFO L470 AbstractCegarLoop]: Abstraction has 4951 states and 7117 transitions. [2021-12-14 15:39:39,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:39:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 7117 transitions. [2021-12-14 15:39:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-14 15:39:39,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:39,149 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:39:39,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-14 15:39:39,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:39:39,366 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:39,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1365063130, now seen corresponding path program 1 times [2021-12-14 15:39:39,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:39,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277958328] [2021-12-14 15:39:39,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:39,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 15:39:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 15:39:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:39:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-14 15:39:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-14 15:39:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 15:39:39,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:39,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277958328] [2021-12-14 15:39:39,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277958328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:39,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:39:39,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:39:39,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643837501] [2021-12-14 15:39:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:39,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:39:39,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:39:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:39:39,507 INFO L87 Difference]: Start difference. First operand 4951 states and 7117 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-14 15:39:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:40,221 INFO L93 Difference]: Finished difference Result 5129 states and 7302 transitions. [2021-12-14 15:39:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 15:39:40,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2021-12-14 15:39:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:40,230 INFO L225 Difference]: With dead ends: 5129 [2021-12-14 15:39:40,230 INFO L226 Difference]: Without dead ends: 5126 [2021-12-14 15:39:40,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-14 15:39:40,232 INFO L933 BasicCegarLoop]: 4284 mSDtfsCounter, 4634 mSDsluCounter, 16407 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 20691 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:40,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4667 Valid, 20691 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 15:39:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2021-12-14 15:39:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 4950. [2021-12-14 15:39:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4950 states, 4523 states have (on average 1.4616405040902056) internal successors, (6611), 4544 states have internal predecessors, (6611), 239 states have call successors, (239), 171 states have call predecessors, (239), 186 states have return successors, (263), 236 states have call predecessors, (263), 238 states have call successors, (263) [2021-12-14 15:39:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 7113 transitions. [2021-12-14 15:39:40,363 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 7113 transitions. Word has length 203 [2021-12-14 15:39:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:40,363 INFO L470 AbstractCegarLoop]: Abstraction has 4950 states and 7113 transitions. [2021-12-14 15:39:40,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-14 15:39:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 7113 transitions. [2021-12-14 15:39:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-14 15:39:40,366 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:40,367 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:39:40,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 15:39:40,367 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -575528242, now seen corresponding path program 1 times [2021-12-14 15:39:40,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:40,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887712837] [2021-12-14 15:39:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:40,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:39:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:39:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:39:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:39:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:39:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 15:39:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 15:39:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:39:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-14 15:39:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:39:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-14 15:39:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:39:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-14 15:39:40,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:39:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887712837] [2021-12-14 15:39:40,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887712837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:39:40,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:39:40,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:39:40,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888448746] [2021-12-14 15:39:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:39:40,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:39:40,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:39:40,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:39:40,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:39:40,431 INFO L87 Difference]: Start difference. First operand 4950 states and 7113 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 15:39:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:39:40,756 INFO L93 Difference]: Finished difference Result 6530 states and 8949 transitions. [2021-12-14 15:39:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:39:40,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2021-12-14 15:39:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:39:40,765 INFO L225 Difference]: With dead ends: 6530 [2021-12-14 15:39:40,765 INFO L226 Difference]: Without dead ends: 5474 [2021-12-14 15:39:40,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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:39:40,768 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 195 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 16416 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:39:40,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 16416 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:39:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2021-12-14 15:39:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 4953. [2021-12-14 15:39:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4953 states, 4526 states have (on average 1.4613345117101193) internal successors, (6614), 4547 states have internal predecessors, (6614), 239 states have call successors, (239), 171 states have call predecessors, (239), 186 states have return successors, (263), 236 states have call predecessors, (263), 238 states have call successors, (263) [2021-12-14 15:39:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 7116 transitions. [2021-12-14 15:39:40,902 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 7116 transitions. Word has length 207 [2021-12-14 15:39:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:39:40,902 INFO L470 AbstractCegarLoop]: Abstraction has 4953 states and 7116 transitions. [2021-12-14 15:39:40,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 15:39:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 7116 transitions. [2021-12-14 15:39:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-14 15:39:40,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:39:40,906 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:39:40,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 15:39:40,907 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:39:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:39:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash 567683991, now seen corresponding path program 1 times [2021-12-14 15:39:40,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:39:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003292249] [2021-12-14 15:39:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:39:40,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:39:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:39:40,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 15:39:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:39:40,981 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 15:39:40,981 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 15:39:40,982 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 15:39:40,983 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 15:39:40,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 15:39:40,986 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:39:40,988 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 15:39:41,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:39:41 BoogieIcfgContainer [2021-12-14 15:39:41,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 15:39:41,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 15:39:41,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 15:39:41,138 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 15:39:41,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:38:52" (3/4) ... [2021-12-14 15:39:41,139 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 15:39:41,256 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 15:39:41,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 15:39:41,257 INFO L158 Benchmark]: Toolchain (without parser) took 56743.35ms. Allocated memory was 134.2MB in the beginning and 9.2GB in the end (delta: 9.1GB). Free memory was 103.5MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2021-12-14 15:39:41,258 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 15:39:41,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2489.02ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 103.0MB in the beginning and 95.9MB in the end (delta: 7.2MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2021-12-14 15:39:41,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 374.99ms. Allocated memory was 190.8MB in the beginning and 308.3MB in the end (delta: 117.4MB). Free memory was 95.9MB in the beginning and 161.8MB in the end (delta: -65.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2021-12-14 15:39:41,260 INFO L158 Benchmark]: Boogie Preprocessor took 433.59ms. Allocated memory is still 308.3MB. Free memory was 161.8MB in the beginning and 163.9MB in the end (delta: -2.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2021-12-14 15:39:41,260 INFO L158 Benchmark]: RCFGBuilder took 4678.02ms. Allocated memory was 308.3MB in the beginning and 629.1MB in the end (delta: 320.9MB). Free memory was 163.9MB in the beginning and 376.1MB in the end (delta: -212.2MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. [2021-12-14 15:39:41,261 INFO L158 Benchmark]: TraceAbstraction took 48640.01ms. Allocated memory was 629.1MB in the beginning and 9.2GB in the end (delta: 8.6GB). Free memory was 376.1MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2021-12-14 15:39:41,262 INFO L158 Benchmark]: Witness Printer took 119.23ms. Allocated memory is still 9.2GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-12-14 15:39:41,267 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.16ms. Allocated memory is still 79.7MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2489.02ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 103.0MB in the beginning and 95.9MB in the end (delta: 7.2MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 374.99ms. Allocated memory was 190.8MB in the beginning and 308.3MB in the end (delta: 117.4MB). Free memory was 95.9MB in the beginning and 161.8MB in the end (delta: -65.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 433.59ms. Allocated memory is still 308.3MB. Free memory was 161.8MB in the beginning and 163.9MB in the end (delta: -2.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * RCFGBuilder took 4678.02ms. Allocated memory was 308.3MB in the beginning and 629.1MB in the end (delta: 320.9MB). Free memory was 163.9MB in the beginning and 376.1MB in the end (delta: -212.2MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. * TraceAbstraction took 48640.01ms. Allocated memory was 629.1MB in the beginning and 9.2GB in the end (delta: 8.6GB). Free memory was 376.1MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 119.23ms. Allocated memory is still 9.2GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. 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 t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] 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_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11446] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11272] t1_pc = 1 [L11273] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND TRUE t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11308] t2_pc = 1 [L11309] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET transmit2() [L11446] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] tmp = exists_runnable_thread() [L11451] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11214] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11220] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] 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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11462] RET master() [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11278] token += 1 [L11279] E_2 = 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11272] t1_pc = 1 [L11273] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND FALSE !(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11314] token += 1 [L11315] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11308] t2_pc = 1 [L11309] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET transmit2() [L11446] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, tmp_ndt_3=1, token=2] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, tmp_ndt_3=1, token=2] [L11449] tmp = exists_runnable_thread() [L11451] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, tmp_ndt_3=1, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11206] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11228] COND FALSE !(token != local + 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11242] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 11049]: 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, 2323 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69872 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69711 mSDsluCounter, 331943 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214147 mSDsCounter, 757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5604 IncrementalHoareTripleChecker+Invalid, 6361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 757 mSolverCounterUnsat, 117796 mSDtfsCounter, 5604 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3573 GetRequests, 3351 SyntacticMatches, 6 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33589occurred in iteration=14, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 14837 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 6960 NumberOfCodeBlocks, 6960 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6706 ConstructedInterpolants, 0 QuantifiedInterpolants, 10859 SizeOfPredicates, 9 NumberOfNonLiveVariables, 9564 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 3368/3904 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:39:41,301 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